A sparse array is an array in which most of the elements have the same value (known as the default value—usually 0 or null). The occurrence of zero elements in a large array is inefficient for both computation and storage. It is required to implement a sparse 2- dimensional array in more efficient way. Your implementation should
allow:
 Adding new value in a specific index.
 Removing a value from a specific index.
 Search for a value and return its index if found.
 Return a value from a specific index.

Solve with the data structure in c code