(a) $\alpha\left(n^{2}\right)$
(b) $\alpha(n)$
(c) $O(n \log n)$
(d) $O\left(n^{2} \log n\right)$
Q. 6 Consider the following sorting algorithm.
I
\[
\begin{array}{l}
\text { ting }(A, \text { low, high }) \\
\text { if }(\text { low }=\text { high }) \text { return; } \\
\text { if }(\text { low }+1=\text { high }) \\
\text { if }(\text { Allow }]>A[\text { high }]) \\
\quad \text { Swap }(A[l o w], A[\text { high }]) ; \\
\text { return; } \\
t_{1}=\text { low }+\left(\frac{\text { high }- \text { low }+1}{3}\right) ; \\
t_{2}=\text { low }+2 \cdot\left(\frac{\text { high }- \text { low }+1}{3}\right) \text {; }
\end{array}
\]
Sorting ( $A$, low, $t_{2}$ );
Sorting ( $A, t_{1}$, high);
Sorting ( $A$, low, $t_{2}$ );
\}
What is the running time of $\operatorname{Sorting}(A, 1, n)$ function.
(a) $\Theta\left(n^{1.7}\right)$
(b) $\Theta\left(n^{27}\right)$
(c) $\Theta\left(n^{37}\right)$
(d) $\Theta\left(n^{0.7}\right)$
Q. 7 Which of the following is/are true?
