Suppose we are performing a binary search on a sorted array called numbers initialized as follows: @ 1 2 3 4 5 6 7 8 9 10 11 12 int[] numbers = {-12,-18, 4, 7, 9, 13, 19, 22, 38, 45, 53, 77, 94}; // index 1/ search for the value 9 in the numbers array (size 13) Write the indexes of the elements that would be examined by the binary search during each round and write the value that would be returned from the search. Round 1: Min = 0, Max = 12, Mid = 6 Round 2: Min- Max - . Mid- Round 3: Min- Max - Mid