1. code the n term of Fibonacci, using iteration, then use recursion only, then use recursion and memorization. What is the time complexity and space complexity for all three cases. 2. Linear regression of X and y, X is n-dimensional and y is 1-dimensional, how would beta, standard error of beta, r2, and t-stat of beta change if you duplicate the data. Can you explain the results intuitively? 3 London has p probability of rain. You have 3 friends, they have 2/3 probability of telling truth, and 1/3 probability lying. Suppose all friends tell you rain, what is the probability it rains? 4. Leetcode
