Question 2: (15 points) Page 3/13 Given the following array, demonstrate how the Binary Search method of searching an array will work. At each step, you should list the array slot (index) that is checked, and what this tells you. Note that you may or may not need all of the passes printed below. Note also that you should not use any optimizations beyond was what covered in the Binary Search. pseudocode for the standard Demonstrate what the algorithm does, when it's asked to find 3 in the following arra Index 012 3 456 Value In that 8 19 20 21 22 3110 | 20130 | 35 | 36 | 42 | 43 | 44 | 50 | si 152 l s3 | 54 | ss | ? ss 199 index of min element in the current range: Index of Max element: - Array index checked: (Value at that index: What does this tell you? Iteration #2 Index of min element in the current range: Index of Max element: Array index checked: (Value at that index: What does this tell you? Iteration #3 Index of min element in the current range: Index of Max element: Array index checked: (Value at that index: What does this tell you? Iteration Index of min element in the current rangeIndex of Max element: Array index checked: (Value at that index: What does this tell you? Iteration #5: Index of min element in the current range: Index of Max element: Array index checked: (Value at that index: What does this tell you? Iteration #6: Index of min Index of Max element What does this tell you