Question 3 (2 points) Suppose you are running a program with a particular algorithm. The number of data elements and their running times in seconds are given in the tables below. Select the matching Big-O efficiency for each of the given timings: 1. O(1) 2. O(logn) 3. O(n) 4. O(nlogn) 5. O(n2) \begin{tabular}{|r|r|} \hline n & Time \\ \hline 1000 & 5 \\ \hline 2000 & 10 \\ \hline 4000 & 20 \\ \hline 8000 & 40 \\ \hline \end{tabular}