Answer Happy

Simulate the binary-search algorithm for finding 16 in A[] = {1, 3, 7, 9, 14, 15, 17, 24, 81, 90). Fill in the following. Initially left = type your answer... and right type your answer... At the end of first iteration, left = type your answer... type your answer... At the end of second iteration, left = At the start of the third iteration, mid= type your answer... type your answer... At the start of the first iteration of the loop, mid= type your answer... At the start of the second iteration, mid= and right= and right = type your answer... type your answer... and right = type your answer... At the end of third iteration, left = type your answer... The final index returned is type your answer...