Pseudocode Problems. (Need solutions for all of them).

Give the pseudocode for the Towers of Hanoi problem and state the worst case running time for the code. (Initial Post: A; Final Post: B; Scratch post: C; N rings). Give the pseudo code to evaluate a prefix evaluation using a stack and state the worst case running time for the code. Give the pseudo code to evaluate a postfix evaluation using a stack and state the worst case running time for the code. Give the pseudo-code for an out-of-place sorting algorithm and state the worst case running time for your code. Give the pseudo-code for the ternary search algorithm. Assume you are searching for a element "x", with a maximum "n" number of inputs. State the worst case running time for your code