1. The following numbers are inserted into a linked list in this order:10, 20, 30, 40, 50, 60What would the following statements display?pCur = head->next;cout << pCur->data << " ";cout << pCur->next->data << endl;a. 20 30b. 40 50c. 10 20d. 30 402. Assume a linked list has the following data:10, 20, 30, 40, 50, 60Assume pre points to the third node in the list and cur = pre->next. The following statementpre->next = cur->nextremoves from the lista. 20b. 50c. 30d. 403. The following member function of the NumberList classint NumberList::guess(){ int value = 0;ListNode *pCurr = head;while( pCurr != NULL ){value += pCurr->data;pCurr = pCurr->next;
}return value;}returns the a. value in the last node in a linked listb. sum of the values in a linked listc. largest value in a linked listd. average of the values in a linked liste. smallest value in a linked list4. Inserting a new element into a linked list can be done a. only in the middleb. only at the endc. only in the beginningd. anywhere5. The following member function of the NumberList classint NumberList::guess(){ListNode *pCurr = head;while( pCurr->next != NULL ){
pCurr = pCurr->next;}return pCurr->data;}returns the a. smallest value in a linked listb. sum of the values in a linked listc. value in the last node in a linked listd. average of the values in a linked liste. largest value in a linked list6. One of the following is not a basic linked list operation:a. insertb. create // constructorc. build list from filed. traversee. searchf. deleteg. destroy // destructor