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 Amid vs x 1 2 3 4 high mid Amid] vs X (b) x = 29 Iteration low 1 2 3 4 5 high mid Amid vs x (e) x = 47 Iteration low 1 2 3 4 5 high mid A mid vs x (d) x = 6 Iteration low 1 2 3 4 5