Problem
1. Write a C function that sets the value of the clement in the ith row and jth column of a sparse matrix to v, assuming that the matrix is represented in a linked-list representation with no nodes for zero entries.
2. Give a method for evaluating a polynomial with known roots r1, r2, ... rn and compare your method with Home's method.
3. Write a program to evaluate polynomials using Homer's method, where the polynomials are represented with linked lists. Be sure that your program works efficiently for sparse polynomials.