Transform the following infix expression into postfix expression with the help of stack data structure. A*(B + C*D) + E Which one of the following is an application of Queue Data Structure? (A) When a resource is shared among multiple consumers (B) When data is transferred asynchronously (data not necessarily received at same rate as sent) between two processes (C) Load Balancing (D) All of the above Write a function that takes two lists, each of which is sorted in increasing order, and merge the two together into one list which should also be in an increasing order. The function should return the new list, (use recursion)