1. In a sorted array containing 1,000, 000, 000 entries you search for a specific key. In the worst case how many comparisons will this take? 2. How many moves are made by the Towers of Hanoi program for 30 disks? 3. (a) Algorithm A has a running time of 10n, whereas Algorithm B has running time n log n. Up to roughly which n will algorithm B perform better than A? (b) Algorithm A has a running time of 2n, whereas Algorithm B has running time 10n2. Up to roughly which n will algorithm A perform better than B? (a) The complete and balanced binary tree of height 30 has how many nodes? (b) A complete and balanced binary tree with no fewer than 1,000,000 leaves has at least 4. what height? 5. Give the e-order of the following code segments written in pseudocode: (a) mystery (n: integer) f for int i n-2; i