Question 2 (6 points) Saved Match each of the following Big-O notations to its equivalent case scenario Selection sort - worst case 4 scenario 3 Binary search - worst case scenario 1. O(1) Insertion sort - average case scenario 2. O(n) 1 Linear search - best case 3. O(log2 7) scenario Binary search - best case 4. O(n2) 1 scenario