Let P be a quicksort program to sort numbers in ascending order. Let t₁ and t₂ be the time taken by the program for the inputs [1 2 3 4] and [5 4 3 2 1], respectively. Which of the following holds?

What is the generating function G (z) for the sequence of Fibonacci numbers?

Solve the recurrence equations
T (n) = T (n - 1) + n
T (1) = 1

It is possible to construct a binary tree uniquely whose pre-order and post-order traversals are given.