Suppose you have an algorithm that tests whether any element of an array is duplicated elsewhere in the array. The first element must be compared with every other element in the array. The second element must be compared with every other element except the first $($it was already compared to the first$).$ The third element must be compared with every other element except the first two. In the end, this algorithm makes $($n $1)+($n $2)+...+2+1$ or n$2/2$ n$/2$ comparisons. Which of the following statements is false? Question $16$ options: Big O is concerned with how an algorithm's run time grows in relation to the number of items, n$,$ processed. When n is small, O$($n$2)$ algorithms $($on today's super fast computers$)$ will not noticeably affect performance, but as n grows, you'll start to notice performance degradation. An O$($n$2)$ algorithm operating on a billion$-$element array $($not unusual in today's big$-$data applications$)$ would require a quintill