- there is simplebut inefficientalgorithmcalled bubble-sortfor sorting list of comparable elements this algorithm scans the list - timeswherein each scanthe algorithm compares the current element with the next one and swaps them if they are out of order implement bubble sort function that takes positional list as parameter what is the running time of this algorithmassuming the positional list is implemented with doubly linked listc- to better model fifo queue in which entries may be deleted before reaching the frontdesign positionalqueue class that supports the complete queue adtyet with enqueue returning position instance and support for new methoddelete( )that removes the element associated with position from the queue you may use the adapter design pattern (section )using positionallist as your storage - describe an efficient method for maintaining favorites list lwith moveto-front heuristicsuch that elements that have not been accessed in the most recent accesses are automatically purged from the list - exercise - introduces the notion of natural join of two databases describe and analyze an efficient algorithm for computing the natural join of linked list of pairs and linked list of pairs - write scoreboard class that maintains the top scores for game application using singly linked listrather than the array that was used in section - describe method for performing card shuffle of list of elementsby converting it into two lists card shuffle is permutation where list is cut into two listsl and where is the first half of and is the second half of land then these two lists are merged into one by taking the first element in then the first element in followed by the second element in the second element in and so on projects - write simple text editor that stores and displays string of characters using the positional list adttogether with cursor object that highlights position in this string simple interface is to print the string and then to use second line of output to underline the position of the cursor your editor should support the following operationsleftmove cursor left one character (do nothing if at beginningrightmove cursor right one character (do nothing if at endinsert cinsert the character just after the cursor deletedelete the character just after the cursor (do nothing at end