5. Determine the efficiency and big-O notation for the following algorithm: The algorithm processes an input with the size of 4096 in the run-time of 512 milliseconds; The algorithm processes an input with the size of 16,384, with the run-time of 8192 milliseconds (4pts). 6. Two students and their teacher each wrote algorithms for the same problem. They tested the three algorithms with two sets of data as shown below, Case 1: n = 10 Run-time for student 1:1 Run-time for student 2: 1/100 Run-time for teacher: 1/1000 Case 2: n = 100 Run-time for student 1: 10 Run-time for student 2:1 Run-time for teacher: 1 What is the efficiency for each algorithm? Which is the best? Please explain your answer with calculating the efficiency and big-O notation analysis. (6pts)