bigOhFunc

The mystery algorithms class contains six static algorithms. You will need to determine the complexity of each. In the BigOhFunc method, you should use the complexity of each algorithm to return an appropriate number for the algorithm select and the value of $n$ provided. For example, if you think an algorithm is $O(n^2),$ you should return Math.pow $(n,2)$ when that algorithm is selected.

For both methods, consider using a switch statement to select the correct algorithm. If an invalid number is passed to the choice parameter, return $-1.$