1) Suppose that you have an algorithm that required 10 seconds to run on a problem size of 1000. How long would you expect the algorithm to run on a problem size of 10,000?

2) Analyze the below algorithm to determine its theta notation, ( ). 
i := n 
while i > 0 do 
   for k = 1 to n do 
      j := 1 
      while j < i do 
          < something of > 
          j := j * 2 
     end while 
   end for 
   i := i / 2 
end while 

3) i := n 
while (i >= 1) do 
   for j := 1 to i do 
      for k := 1 to n do 
         something that takes O(1) 
      end for k 
   end for j 
   i := i / 2 
end while