4. (40 pts) Let A M,(R) be positive definite, and assume its largest eigenvalue is strictly greater than the second largest eigenvalue. You are given the following algorithm: start with a randomly generated vector 2(0) ER" such that ||20|||2 = 1. For t = 1, 2, 3, ... , recursively compute: (t) Ac(t-1) ||A.c(t-1| Question: what does this algorithm converge to? 4. (40 pts) Let A M,(R) be positive definite, and assume its largest eigenvalue is strictly greater than the second largest eigenvalue. You are given the following algorithm: start with a randomly generated vector 2(0) ER" such that ||20|||2 = 1. For t = 1, 2, 3, ... , recursively compute: (t) Ac(t-1) ||A.c(t-1| Question: what does this algorithm converge to