PLEASE HELP ME

1. Common Big O complexities Many commonly used algorithms have running time functions that belong to one of a handful of growth function, namely constant, logarithmic, linear, linearithmic, quadratic, and exponential runtime complexity. a. Identify the Big-O notations for each of the runtime complexity b. Match the following commonly used algorithms to its corresponding runtime complexity: - findMin(x, y) - BinarySearch - LinearSearch - MergeSort - SelectionSort - Fibonacci