Write a C$++$code for this question:

$**$Avoid using external libraries except for iostream.$**$

Take input from user.

Use single pointer only.

You are tasked with designing a real$-$time messaging application similar to WhatsApp, where messages need to be delivered in the order they were sent and received across multiple users. You decide to use a queue data structure to handle message delivery efficiently.

$$ Your task is to implement the queue data structure and the messaging system using the following specifications:

$$ Implement a queue to store messages. Each message is represented by a tuple $($timestamp$,$ sender$\_$id$,$ message$\_$content$),$ where timestamp is a unique integer representing the time the message was sent, sender$\_$id is a unique identifier for the sender$,$ and message$\_$content $i$s a string representing the content of the message. Messages should be stored in the order they are received.

$$ Design a sendMessage function that takes parameters sender$\_$id and message$\_$content, and adds the message to the end of the queue with the current timestamp. Ensure that messages are inserted into the queue in O$(1)$ time complexity.

$$ Design a receiveMessage function that retrieves and returns the message from the front of the queue. Ensure that message retrieval is performed in O$(1)$ time complexity.

$$ Implement a displayMessages function that displays all messages currently in the queue in the order they would be received.

$$ Test your implementation by simulating the following scenario: User A sends three

messages at timestamps $5,3,$ and $7,$ while User B sends two messages at timestamps $4$ and Display the messages received in the application in the correct order.