Given below are some applications. Choosing from the options, pick the one that allocates a suitable data structure for implementing these applications:
1. Representation of a sparse matrix
2. Fast access to any item from a set of data
3. Convert infix expressions to postfix expression
4. Storing the terms of a long polynomial with arbitrary number of terms
1
Linked list, array listed list and stack
2
Stack, array and stack listed list
3
Array array, tree and stack
4
Linked list, array and stack listed list
5
Question Not Attempted