entries in by increasing indices or notc- there is simplebut inefficientalgorithmcalled bubble-sortfor sorting sequence of comparable elements this algorithm scans the sequence - timeswherein each scanthe algorithm compares the current element with the next one and swaps them if they are out of order give pseudo-code description of bubble-sort that is as efficient as possible assuming is implemented with doubly linked list what is the running time of this algorithmc- answer exercise - assuming is implemented with an array list - useful operation in databases is the natural join if we view database as list of ordered pairs of objectsthen the natural join of databases and is the list of all ordered triples ( , ,zsuch that the pair ( ,yis in and the pair ( ,zis in describe and analyze an efficient algorithm for computing the natural join of list of pairs and list of pairs - when bob wants to send alice message on the internethe breaks into data packetsnumbers the packets consecutivelyand injects them into the network when the packets arrive at alice' computerthey may be out of orderso alice must assemble the sequence of packets in order before she can be sure she has the entire message describe an efficient scheme for alice to do this what is the running time of this algorithmc- given list of positive integerseach represented with logn describe an ( )-time method for finding -bit integer not in bitsc- argue why any solution to the previous problem must run in ohm(ntime - given list of arbitrary integersdesign an ( )-time method for finding an integer that cannot be formed as the sum of two integers in