chap listsstacksand queues in the linked list implementation presented in section the current position is implemented using pointer to the element ahead of the logical current node the more "naturalapproach might seem to be to have curr point directly to the node containing the current element howeverif this was donethen the pointer of the node preceding the current one cannot be updated properly because there is no access to this node from curr an alternative is to add new node after the current elementcopy the value of the current element to this new nodeand then insert the new value into the old current node (awhat happens if curr is at the end of the list alreadyis there still way to make this workis the resulting code simpler or more complex than the implementation of section (bwill deletion always work in constant time if curr points directly to the current node add to the llist class implementation member function to reverse the order of the elements on the list your algorithm should run in th(ntime for list of elements write function to merge two linked lists the input lists have their elements in sorted orderfrom smallest to highest the output list should also be sorted from highest to lowest your algorithm should run in linear time on the length of the output list circular linked list is one in which the next field for the last link node of the list points to the first link node of the list this can be useful when you wish to have relative positioning for elementsbut no concept of an absolute first or last position (amodify the code of figure to implement circular singly linked lists (bmodify the code of figure to implement circular doubly linked lists section states "the space required by the array-based list implementation is ohm( )but can be greater explain why this is so section presents an equation for determining the break-even point for the space requirements of two implementations of lists the variables are dep and what are the dimensional units for each variableshow that both sides of the equation balance in terms of their dimensional units use the space equation of section to determine the break-even point for an array-based list and linked list implementation for lists when the sizes for the data fielda pointerand the array-based list' array are as specified