Data Structures and Abstractions with Java $,$ complete the following:

#$10$ what is the Big Oh of the following computation:

int sum $=0$; for $($int counter $=$ n; counter $>0$; counter $=$ counter $-2)$ sum $=$ sum $+$ counter;

Exercise #$12$ Suppose that your implementation of a particular algorithm appears in Java as follows: for $($int pass $=1$; pass $<=$ n; pass$++)\{$ for $($int index $=0$; index $<$ n; index$++)\{$ for $($int count $=1$; count $<10$; count$++)\{...\}//$ end for $\}//$ end for $\}//$ end for

Exercise # $24$: 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 the $2$ was not chosen and is not in the array. Write Java code that finds the integers that does not appear in such an array. Your solution should use O$($n$^2)$ operation and O$($n$)$ operations

Exercise # $16$ Consider two programs A and B$.$ Program A requires $100$ xn$^2$ operations and program B requires $2^$n operations. For which values of n will Program A execute faster than Program B$?$

For each exercise, show your work and all of the steps taken to determine the Big$-$Oh for each problem. Partial credit cannot be awarded without showing work. Submit all work $.$