Requirements: 1. You decide whether to use C or CH- strings, as long as movie titles can be up to 5D characters long. 2. Do case-independent sorting, but do not convert case of any input. 3. You decide upon your rating system can be any data type. 4. The "remove" option should actually remove the node. Use sequence numbering to identify the movie to remove, with the valid range of numbers in the prompt. 5. You decide what to say, if anything, if there's no match for any of the user's input. 6. Use a queue to store the movie information. Initially, the queue is loaded with data from a le named \"movies.txt". If the le doesn't exist, start with an empty queue. F. 1ir'v'n'te a function to add a new node at the back of the queue. B. The output table should have nicelyspaced column headings and sequence numbering. 9. Use blank lines in the output to separate blocks of text as modeled in the sample output above. 10. Avoid memory leaks as nodes are removed and when the program ends use a delete loop. 11. At the end of your program, save all data into a le named \"movies.t:rt". You should write a string "EDF" at the end of your le so that you can tell there is no more data when you read it back