Consider the usual algorithm to convert ail 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: Now, suppose that you read and process the 11 th symbol of the input. Draw the stack for the case where the 11th symbol is: A. A number: b. A Left parenthesis C. A right parenthesis D. A minus sign: Here is an array of ten integers: 5389170264 Draw this array after the FIRST iteration of the large loop in a selection sort (sorting from smallest to largest). Describe a case where quicksort will result in quadratic behavior. Fill in the following table for the times to sort an array of n items. Use only big-O notation, and do not have any extraneous constants in your expressions