Given the following algorithm written in pseudocode. Assume that input to the algorithm NEW are an array A of length n. The time complexity of the function RANDOM (A) is assumed to be θ (n) .
A) O(n)
B) Ω(n)
C) θ(n)
D) O(1)