Using Binary Search, locates the position of first (E), last (1) and middle (m) variables after complete 1st cycle of searching process on the following list for search key of 10: [0]. [1] [2] [3] [4] [5] [6] [7] [8] [9] [10] 7 15 36 47 69 8 8 39 94 97 100 f m 1 Select one: a. f=88, l=100, m=94 b. f=7, 1=69, m=36 c. f-6, 1=10, m=8 d. f-0, 1-4, m=2 Consider the following list: 2 12 15 44 55 63 83 99 100 120 Using Linear Sequential Search, how many comparisons are required to find whether 50 is in the list? Select one: a. 5 b. 10 C. 11 d. 4