Write a pseudocode function that interchanges two adjacent items of: (a) singly linked lists (b) doubly linked lists Evaluate the following postfix expressions. Show the status of the stack after each step of the algorithm. Assume the following values for the identifiers: a = 7, b=3, c= 12, d = -5, e = 1. (a) a b c +- (b) abc-d*+ (c) ab+c-de*+ Convert the following infix expressions to postfix form. Show the status of the stack after each step of the algorithm. (a) a-b+c (b) a/b/c-(d+ e) *f (c) a (b +c* d) /e Write a program that uses a stack to test whether a given string is a palindrome. Efficiently implement a queue class using a circular array. You may use a vector (rather than a primitive array) as the underlying array structure.