= We apply sparse linear algebra to solve the tangent problem JS = -F for the discrete problem above. Which of the following claims are true? There may be more than one correct answer. -2 marks for each incorrect answer. The sparse storage required to store J is O(nnz), where nnz is the number of nonzero elements. 4 doubles of memory to store the Jacobian The row-major sparse format requires 7n matrix. The coordinate format is the most efficient sparse storage format. Only nonzero elements larger than some cutoff, \Jijl > e, need to be stored in the sparse array. The Thomas algorithm can be applied to solve the tangent problem for the discrete problem above