Assume that sort is called with the array {5, 4, 3, 2, 1} . How many times will the expression indicated by /* Shuffle elements upwards */ and the statement indicated by /* Insert value into position */ execute

Consider the usual algorithm to convert an infix expression to a postfix expression. suppose that you have read 10 input characters during a conversion and that the stack now contains these symbols: (5 points) | | | + | | ( | bottom |_*_| now, suppose that you read and process the 11th symbol of the input. draw the stack for the case where the 11th symbol is