Your task is to find a grouping of the jugs into pairs of red and blue jugs that hold the same amount of water. To do so, you may perform the following operation: pick a pair of jugs in which one is red and one is blue, fill the red jug with water, and then pour the water into the blue jug. This operation will tell you whether the red or the blue jug can hold more water, or that they have the same volume. Assume that such a comparison takes one time unit. Your goal is to find an algorithm that makes a minimum number of comparisons to determine the grouping. Remember that you may not directly compare two red jugs or two blue jugs. Required:
a. Prove a lower bound of Ω(n lg n) for the number of comparisons that an algorithm solving this problem must make.
b. Give a randomized algorithm whose expected number of comparisons is O(n lg n), and prove that this bound is correct. What is the worst-case number of comparisons for your algorithm?

well cos like a ds it doesn't really die out, unlike for example, fifa, they always come out with a new version, so lets say your fifa 18 is charging you to update the teams and stuff, so, if messi were to go to real madrid (never gonna happen) it would switch messi to the other team, until the owners of fifa come out with fifa 19, then the game would eventually stop updating, and back to the ds, it doesn't really stop working after sometime because there's lots of things that it could be used for, and idk if u know what i'm saying, but long story short, samsung, represents the ds, if they still work, and people love them but not the new version, the old version still works, so they don't really force people to buy new phones, get me?

answer; i do believe its (faster);

solution:

the right option is a

to adding   a new row to a table we   have to do process last table cell and pressing tab.

this is the process to add new row in the cell:

* to add a row below the cell, click insert below in the rows and columns group.

thus this is the required right answer.