The function pascal generates symmetric test matrices based on Pascal's triangle. (a) How are the elements of pascal (n+1) related to the binomial coefficients generated by nchoosek(n,k)? (b) How is chol(pascal(n)) related to pascal(n)? (c) How does condest (pascal(n)) grow with increasing order n? (d) What is det (pascal(n))? Why? (e) Let Q be the matrix generated by Q = pascal(n); Q(n,n) = Q(n,n) - 1; How is chol(Q) related to chol (pascal(n))? Why? (f) What is det(Q)? Why? The function pascal generates symmetric test matrices based on Pascal's triangle. (a) How are the elements of pascal (n+1) related to the binomial coefficients generated by nchoosek(n,k)? (b) How is chol(pascal(n)) related to pascal(n)? (c) How does condest (pascal(n)) grow with increasing order n? (d) What is det (pascal(n))? Why? (e) Let Q be the matrix generated by Q = pascal(n); Q(n,n) = Q(n,n) - 1; How is chol(Q) related to chol (pascal(n))? Why? (f) What is det(Q)? Why