Which of the following points is/are true about Linked List data structure when it is compared with array (a) It is easy to insert and delete elements in Linked List (b) Random access is allowed in a typical implementation of Linked Lists (c) The size of array has to be pre-decided, inked lists can change their size any time. 1. (d) All of the above 2. is/are linear data structure. a) double b) link list c nt d) array 3. In link list each node contains a and a to some other node a) value link b) value pointer ) none sis the number of elements in it b) Successor 4 A list' a) Length c) Predecessor d) none