What are the asymptotic complexity of solving the following problems efficiently,

give your answer in terms of $,$ or O notation: $[10]$

a$.$ Finding Min in an unsorted array.

b$.$ Finding a Key in a sorted array.

c$.$ Finding Max in a sorted array.

d$.$ Merging two sorted array into a larger sorted array.

e$.$ Pivoting $($as in Quick sort$)$ in an unsorted array.

f$.$ Powering a number $(x^y)$ where the power is an integer.

g$.$ Complexity of any comparison based sorting algorithm.

e$.$ Complexity of Quick sort.

f$.$ Complexity of Radix sort.

g$.$ Complexity of Checking whether an array is sorted or not.

Please provide explanation for each answer $...........$