Implement a Queue data structure as an ADT that does the following: 1) It simulates a Queue in an Ice cream Shop by

a) reading the person info (such as the name, and the type of ice cream he wants to order) b) adds the info to the Queue c) delete the Person info from the Queue when the ice cream is served. 2) Make sure when the program executes, a) it must provide a Main Menu for the program user so he can choose the task and the different task must be: 1) to add a person to the Queue 2) to delete the person when the person is served 3) to print the Queue information 4) to Exit b) the program must continue running until the user chooses to Exit. 3) The Program must a) allow the user to choose the tasks in any order from the Main Menu b) the Queue must reflect (display) the correct Queue information at all points of time.