Sequential Message Decoder

Problem Statement

Sequential Message Decoder Problem Description Imagine a communication system where text data is sent through a network channel. During transmission, individual characters are dispatched along with their positional identifiers. Due to network latency and routing variations, these characters may arrive at the destination in a scrambled sequence rather than their original order. You receive a series of character-position pairs representing the incoming data stream. A complete message spanning from position 'i' to position 'r' must satisfy these criteria: The content cannot be empty It must be bounded by two '*' symbols - specifically, at positions 'i' and 'r'. The '*' character must be present Example: 'greetings' represents a complete message where 'greetings' is the valid content. However, '*greetings*'' would be invalid since '*' represents a gap in the sequence. Your objective is to process each incoming character and position it according to its index_number. The moment any sequence