Enter this matrix in matlab: >> f = [0 1; 1 1] use matlab to find an invertible matrix p and a diagonal matrix d such that pdp-1 = f. use matlab to compare f10 and pd10p-1. let f = (1, 1)t. compute ff, f2f, f3f, f4f, and f5f. (you don't need to include the input and output for these.) describe the pattern in your answers. consider the fibonacci sequence {fn} = {1, 1, 2, 3, 5, 8, 13…}, where each term is formed by taking the sum of the previous two. if we start with a vector f = (f0, f1)t, then ff = (f1, f0 + f1)t = (f1, f2)t, and in general fnf = (fn, fn+1)t. here, we're setting both f0 and f1 equal to 1. given this, compute f30.