Convert the following code to print the list information in a reverse order taking inconsideration that the number of stored elements in the list is 5. (ONLY CORRECT AND WRITE THE LINE TO BE Corrected) void arrayListType: :print() { int i; for(i = 0; i = maxSize) cout Correct the following code int linked List Type Type>::insertFirst(const Type& newItem) { nodeType *newNode; newNode = new nodeType; newNode->info = newItem; newNode->link = last; first = newNode; if(last != NULL) first = newNode; } ? What is the name of the function int arrayListType!: ......... ... (int item) { int loc; bool found = false; for(loc = 0; loc