Select a statement that holds false for singly linked list. O a. First node holds the address of the last node. O b. First node is called as root. O c. It's last node address has NULL. O d. Each node is comprised of data and address part. What differentiates a circular linked list from a normal linked list? O a. You cannot have the 'next' pointer point to null in a circular linked list O b. Head node is known in circular linked list O c. You may or may not have the 'next pointer point to null in a circular linked list O d. It is faster to traverse the circular linked list is very useful in situation when data have to stored and then retrieved in reverse order a. All of the above O b. Stack O c. Queue d. List When does top value of stack changes? a. At the time of deletion O b. While checking underflow O c. After Deletion d. Before Deletion A Graph is a collection of a. Rows and Columns O b. None of these O c. Vertices and Edges O d. Equations