Consider the following sort algorithm: Analyze this algorithm for the following complexities. should provide the annotated code with work per line in a constant term and the number of times that line is repeated, the total T$($n$)$ in terms of constants $($c$1,$ c$2...$ cn$),$ the complexity in Big theta notation, and the c and n$0$ values that show T$($n$)$ has those asymptotic bounds. also provide a justification for the best and worst case time complexities. a$.$ Best case time complexity in Big Theta notation. b$.$ Average case time complexity in Big Theta notation. c$.$ Worst case time complexity in Big Theta notation. d$.$ Space and Auxiliary complexity.