A. Analyze PICTURE #1 below. Write a brief paragraph (100-200 words) on your findings that comments on whether the observed values are consistent with the Big O notation for each sorting algorithm the Figure provides. If the results differ substantially from the figure, discuss why you believe the results are different? Keep in mind that the notations in the Figure, are only for worst-case scenarios.

B. As shown in PICTURE #2. The array sizes are adjusted to hold only 1,000 elements and 9 tests were run again. Write a brief paragraph of (100-200 words), commenting whether the newly observed values are consistent with the Big O notation the Figure, provides. If the results differ substantially from the figure, discuss why you believe the results are different.

(FIGURE) Algorithm Location Big O Searching Algorithms: Linear Search Section 19.2 O(n) Binary Search Section 19.4 O(Log n) Recursive linear search Exercise 19.8 O(n) Recursive binary search Exercise 19.9 O(Log n) Sorting Algorithms: Selection sort Section 19.6 D(n^2) Insertion sort Section 19.7 D(n^2) Merge sort Section 19.8 O(n log n) Bubble sort Exercise 19.5 and 19.6 O(n^2) run Sorting Algorim Best Case Selection sort 1409338500 Insertion sort 4690200 Merge sort 12839700 BUILD SUCCESSFUL (total time: 21 seconds) Average 6258037000 4352359400 21639000 Worst Case 5618962700 4011200700 4821300 run: Sorting Algorim Best Case Selection sort 5368500 Insertion sort 136000 Merge sort 2255900 BUILD SUCCESSFUL (total time: 0 seconds) Average 7435100 5255700 380100 Worst Case 5615500 3340400 200400