Write a linked queue class as a template class. Use the linked queue class provided to convert to a template class. Then write a program that reads a file named "operations.txt" containing operations that will be stored in a queue. The first letter in every line is the code for operation. E: Enqueue (Add to back) D: Dequeue (Remove element from front) P: Print (Print all elements) S: Shift (Move the front element to back). For enqueue operation, the second value in the line is the identification of the operation. An example would be that "E 5" should add Task 5 to the end of the queue. Read each line and perform the requested operation. Below are the contents of the "operations.txt" input file and its output. operations.txt Output E 13 9 8 25 34 E 9 25 34 13 E 8 13 25 12 34 15 D 12 34 15 E 25 E 34 P E 13 E 12 E 15