notes review questions write an algorithm to reverse an input string of characters using stack explain how function calls may be implemented using stacks for return values what are the advantages of implementing stack using dynamic memory allocation method trace the execution of infix-to-postfix algorithm on the following expression ( ( / one way to determine if string of characters is palindrome is to use one stack and one queue and to apply the following algorithm strategy(aput the input string on the stack and the queue simultaneously (bthuspopping the string from the stack is equivalent to reading it backwards while deleting the string from the queue is reading it forwards write program to implement stack of characters explain why we cannot use the following implementation for the method push in our linked stack error_code stack :push(stack_entry itemnode new_top(itemtop_node)top_node new_topreturn success what is wrong with the following attempt to use the copy constructor to implement the overloaded assignment operator for linked stackvoid stack :operator (const stack &originalstack new_copy(original)top_node new_copy top_nodehow can we modify this code to give correct implementationanswersself assessment ( ( ( ( ( ( lifo (last in first out array dynamic polish notation lovely professional university