Which of the following is not the method to represent Sparse Matrix?Select one:a.Dictionary of Keysb.Linked Listc.Arrayd.Heap

The correct answer is d. Heap.

Here's why:

a. Dictionary of Keys: This is a method to represent a sparse matrix. In this method, only non-zero elements are stored as a dictionary where the keys are the indices of elements and values are the elements.

b. Linked List: This is another method to represent a sparse matrix. In this method, each non-zero element is represented as a node in the linked list.

c. Array: This is also a method to represent a sparse matrix. In this method, three arrays are used to store non-zero elements, their row indices, and column indices.

d. Heap: This is not a method to represent a sparse matrix. A heap is a special tree-based data structure, and it does not have a specific application in representing sparse matrices.