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, we only store non-zero elements. Each non-zero element is represented by a tuple: row position, column position, and value.

b. Linked List: This is another method to represent a sparse matrix. We use a linked list where each node has four fields: row position, column position, value, and a pointer to the next node.

c. Array: This is also a method to represent a sparse matrix. We use an array of non-zero elements. Each element is represented by a triplet: row position, column position, and value.

d. Heap: This is not a method to represent a sparse matrix. A heap is a special tree-based data structure that satisfies the heap property. It is mainly used to implement priority queues.