Q1

Write remove_end function for doubly-linked list class assuming first is the only data members of the list and each node has next, prev and info data members. (No need to write .h file) We will use a class studentQ to store all student object in an FIFO queue. If we implement studentQ with forward linked list, write the minimum studentQ.h file. Continue with the studentQ problem above, implement a remove_end function. void studentQ::remove_end() {