A. Given the following array: 8 0 -3 16 -2 -8 40 20 Determine the number of comparisons needed to find each element and the Index location in the array using a Linear and Binary search. (Use the table below to work out the Binary Search) 1) Find -2: Linear: Comparisons Binary: Comparisons Array Index Index Index 2) Find 20: Linear: Comparisons Binary: Comparisons Array Index Index Index 3) Find 0: Linear: Comparisons Binary: Comparisons Index Array Index Index 4) Find 3: Linear: Comparisons Binary: Comparisons Index Array - Index Index 5) Find -5: Linear: Comparisons Binary: Comparisons Index Array Index Index