Problem 1. Convert the following infix expression to a prefix expression by Stack operation. A+B* C+(DAE)' F/G/H + 1 Evaluate the value of prefix expression when A-5, B-10, C-3, D-12, E-3, F-5, G-8, H-4.1-100 Problem 2. Using a queue circular array of size 6, make the following string a palindrome ABCPQR Problem 3. Make a circular linked list an adapter pattern data structure using both as stack and queue implementation Problem 4. Make a doubly linked list an adapter pattern data structure using both as stack and queue implementation