Problem:

Question 1- With the help of an example prove how a binary search can prove to be more efficient than a sequential search for an array of 10 sorted numbers.

Question 2- There are n! permutations of a set of n elements. For example, the set { A, B, C } has 3! = 6 permutations: ABC, ACB, BAC, BCA, CAB, and CBA. There are (n + 1)! permutations of the set after we add a new target. Argue that, if each of these permutations is equally likely, each of the n + 1 places where the target might belong is equally likely.

Step by step instructions so I can understand would be greatly appreciated!