Exercise $3)$

Consider two programs, A and B$.$ Program A requires $1000$ x n$^2$ operations and Program B requires $2$n operaitons. For which values on will Program A execute faster than Program B$?$

Exercise $4)$

Consider an array of length $"$n$"$ containing unique integers in random order and in the range $1$ to n $+1.$ For example an array of length $5$ would contain $5$ unique integers selected randomly from the integers $1$ through $6.$ Thus the array might contain $36514.$ Of the integers $1$ through $6,$ notice that $2$ was not selected and is not in the array. Write Java code that finds the integer that does not appear in such an array. Explain the Big$-$Oh in your code.