In C++

Answer the following questions about the list (2, 7, 1, 8, 2). a) What is the length? b) What are all the prefixes? c) What are all the suffixes? d) What are all the subsists? e) How many subsequences are there? If Land M are lists, under what conditions is LM = ML? Write pseudocode for dictionary operations insert, lookup, and delete using doubly-linked lists with duplicates. State the complexity of your algorithm. Explain each operation with proper examples (show boundary cases: item not found/found/duplicates/empty list). Simulate a stack evaluating the following postfix expressions. Show each step of your calculation. ab + cd +/ef - * Convert the infix expression to a postfix expression. a * b * c/e - f % x Write pseudocodes to implement enQueue(char), deQueuer(), queueOverflow(), queueUnderflow(), checkFront(), and checkRear() operations for a circular queue class that works with character data