Do an average case analysis of iterative Binary Search for search lists of size 4 using the above partitioning of the inputs, and counting comparisons of x with numbers in S. You should assume that all the input classes are equally likely to occur. Also, please show your work, including giving the values of t(Ii ) and p(Ii ) for i = 1,...,9.