for #1 & 2 Determine the asymptotic running time for the following piece of code, assuming that n represents the input size.

1. for(i=0; i < length(a) ; i++)

binary_search(a, a[i]); //key = a[i]

2. for(i=0; i < n; i++)

for(j=0; j < n; j++)

linear_search(a, key); //key is not in array, length(a) == n

3. Suppose a machine on average takes 10-8 seconds to execute a single algorithm step. When does the machine finish executing the below code when n = 100?

for(i=0; i <= n*n; i++)

for(k=0; k <= i; k++)

selection_sort(a); //size(a) = n