Study guide 3 10) How many comparisons would be needed using a binary the value 77 in the following array? search to find [0] [1] 1 14 2729 38 42 55 57 61 64 69 77 79 21 [3] [4] [5] [6] 171 [8] [91 [10] [11] [12] 79184 A. 1 C. 3 B. 2 4 11) How many comparisons would be needed using a binary search to find the value 14 in the following array? 14 27 29 38 42 55 57 61 64 69 77 79 84 A. 1 C. 3 B. 2 D. 4 12) How many comparisons would be needed using a binary search to find the value 69 in the following array? [01 [1] [2 [3] 4] [5] [6] [7] [8] [9] [10] [11] [121 27 9 38 57 61 64 69 77 7984 A. 1 C. 3 B. 2 D. 4 13) How many swaps would be needed to sort the following array using the SELECTION sort algorithm? 19 28 22 30 A. 1 C. 3 B. 2 D. 4 14) How many swaps would be needed to sort the following array using the SELECTION sort algorithm? 32 A. 1 C. B. 2 D. 4 Study guide 3 10) How many comparisons would be needed using a binary the value 77 in the following array? search to find [0] [1] 1 14 2729 38 42 55 57 61 64 69 77 79 21 [3] [4] [5] [6] 171 [8] [91 [10] [11] [12] 79184 A. 1 C. 3 B. 2 4 11) How many comparisons would be needed using a binary search to find the value 14 in the following array? 14 27 29 38 42 55 57 61 64 69 77 79 84 A. 1 C. 3 B. 2 D. 4 12) How many comparisons would be needed using a binary search to find the value 69 in the following array? [01 [1] [2 [3] 4] [5] [6] [7] [8] [9] [10] [11] [121 27 9 38 57 61 64 69 77 7984 A. 1 C. 3 B. 2 D. 4 13) How many swaps would be needed to sort the following array using the SELECTION sort algorithm? 19 28 22 30 A. 1 C. 3 B. 2 D. 4 14) How many swaps would be needed to sort the following array using the SELECTION sort algorithm? 32 A. 1 C. B. 2 D. 4