Question 5 The number of recursive calls required for recursively calculating x" is 0 1+ n log n O 1+n O 1+ log n Question6 The rate of growth for the Towers of Hanoi problem as the number of disks increases is O exponential O quadratic linear constant