1.

Consider the following two sort methods and the following two search methods.

Give the "Big-Oh" time complexity for each method.

- merge sort time complexity: ( )

- sequential search time complexity: ( )

- selection sort time complexity: ( )

- binary search time complexity: ( )

2.

Place the methods described above in order of their "Big-Oh" time complexity, from slowest to fastest growth (i.e. from lowest to highest complexity). As a reminder, here are the methods again:

- merge sort

- sequential search

- selection sort

- binary search

SLOWEST: , , , FASTEST

thanks!