Part 4 5 6
Extracted text: Q# 3: The provided Search algorithm is use to find the specified element in the given array, perform dry run and Calculate Time Complexity of this algorithm? Arrl) = (21, 32, 52, 71, 110, 132, 171, 191, 232, 291, 312, 372, 413, 433, 471, 532, 592, 611, 672, 712, 733, 793, 834, 894, 975) Element = 975 1. Let least = land most = n 2. Take the average of most and least, rounded down so that it is an integer. 3. If average number is actual number, stop. You found it! 4. If the average number was too low, set least to be one larger than the average number. 5. If the average number was too high, set most to be one smaller than the average number. 6. Go back to step two.