Question 1. Algorithms A and B perform the same task. On input of size n, algorithm A executes 0.5n2 steps, and algorithm B executes 300n steps. Find the value of n above which algorithm B is more efficient. Show your work.

Question 2. A long, long time ago, when I was in graduate school, I wrote a program to solve a difficult problem. The program had a time complexity of 2n(yeah, no kidding!). On input of size 50, my program finished in about an hour. How long would it have taken me to run my program on input of size 100?

Question 3. Write an All-Pairs algorithm that is given a list of numbers and a target and outputs each pair of values that sum to the target.