1. Fibonacci Numbers (a) Implement the 3 functions for Fibonacci we wrote in class, one for each of the 3 approaches. (b) Run the 3 functions for different n values and time their runtime and desribe what you see. It will be obvious that already for small values of n, pure recursion takes too much time. So, for further values of n, compare only pure tabulation and recursion with tabulation. For big values of n, which approach seems faster