1 Theory vs. Practice (9 points) List at least 3 reasons why asymptotic analysis may be misleading with respect to actual performance in practice. (3 points) . Suppose finding a particular element in a binary search tree with 1,000 elements takes 5 seconds. Given what you know about the asymptotic complexity of search in a binary search tree, how long would you guess finding the same element in a search tree with 10,000 elements takes? Explain your reasoning. (3 points) . You measure the time with 10,000 elements and it takes 100 seconds! List at least 3 reasons why this could be the case, given that reasoning with the asymptotic complexity suggests a different time. (3 points) 1 Theory vs. Practice (9 points) List at least 3 reasons why asymptotic analysis may be misleading with respect to actual performance in practice. (3 points) . Suppose finding a particular element in a binary search tree with 1,000 elements takes 5 seconds. Given what you know about the asymptotic complexity of search in a binary search tree, how long would you guess finding the same element in a search tree with 10,000 elements takes? Explain your reasoning. (3 points) . You measure the time with 10,000 elements and it takes 100 seconds! List at least 3 reasons why this could be the case, given that reasoning with the asymptotic complexity suggests a different time. (3 points)