-9 6 9 12 B. Given the following array: -12 -6 -3 0 3 6 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 3: Linear: Comparisons Index Binary: Comparisons Index Array Index 2) Find 9: Linear: ComparisonsIndex Array Binary: Comparisons_Index Index Index 3) Find - 15: Linear: Comparisons Array Index Binary: Comparisons_Index 4) Find 10: Linear: Comparisons_Index Array Index Binary: Comparisons Index 5) Find 0: Linear: Comparisons Array Index Binary: Comparisons Index Index