You need to write an algorithm which named is "NEW" in pseudocode. The meaning of the algorithm is not important. Assume that input to the algorithm NEW is an array A of length $\backslash ($ n $\backslash ).$ The time complexity of the function RANDOM $\backslash ((\backslash$mathrm$\{$A$\})\backslash )$ is assumed to be $\backslash (\backslash$theta$($n$)\backslash ).$

For each of the line above write one line of the algorithm that satisfies the given line cost and times of its execution in best$-$case.