Part I: Select the one correct answer (10 points): 1. A function called empty(), which acts on a list, returns: (a) zero if there are no nodes in the list (b) an error if the list contains any nodes (c) true if the list contains no nodes (d) false if the list contains no nodes (e) the result is unknown 2. Which statement regarding classes is NOT true (a) A class provides an open-ended opportunity to create new data types (b) Classes support the concept of inheritance (c) Classes are used in an object-oriented approach to programming (d) One class can never be referenced by another class (e) A class is an extension of a structure, which includes methods as well as data members 3. I have an array which can old N nodes, but which currently contains t nodes. Which is true: (a) Ift N-1, a pop will result in an exception. (b) Ift-0, a pop will result in an exception. (c) Ift N-1, a function called 'addback' will result in an exception. (d) If t # N-2, a push will result in an exception. (e) There are no exception scenarios which can occur. 4. If I have a queue: (a) A singly-linked list is a good implementation choice. (b) A doubly-linked list is not a good implementation choice. (c) It processes based upon a LIFO approach (d) A circularly-linked list is not a good implementation choice. (e) In a circularly-linked list, an enqueue results in addition of a new cursor node. 5. The two-dimensional array defined as string* Mtrx(5) [8: (a) Consists of 40 string pointers (b) Consists of 5 string pointers of 8 bytes each (c) Consists of 5 columns and 8 rows. (d) Is also referred to as a complex duplex array (e) Is not a valid construct, since arrays cannot contain pointers. Part II: True/False. If the statement is false, then correct the underlined term (10 points) 1. IfI use a singly-linked list, it is relatively efficient to remove the last node. 2. The time to insert a value at the end of a doubly-linked list can be expressed as Ofn+1 if the list 3. If 'w' is a pointer to a node, which contains a variable called 'name', then x w-name stores 4. If you link out a node in a list, it is effectively unreachable, even if you do not delete it. contains "n" nodes the address of name in x. a circularly linked list, the last node is pointed to by the cursor