Desgin and analysis of algorthms

Question 2: Given array A - [10, 14, 19, 20, 21, 29, 32, 38, 47), fill the following table to show how BINARYSEARCH finds x. (a)x=14 Iteration low high Mid Almid vs x 1 2 3 4 high mid Afmid vs X (b) x-29 Iteration low 1 2 3 4 5 (e) x 47 Iteration low high mid Afmid) vs X 2 4 5 high mid Afmid) vs * Iteration low 1 2 3 4 5 Page 2 of 3