Note: Solve the question in the given text box and then select the most appropriate answer from the given choices. Consider an algorithm that divide a list of "n" element in two halves and then do one comparision. In worst case it iteratively perform the above tasks until there is only one elements remains in the list Let the time required to divide list of n elements in worst case T (n)-time required to divide remaining half of the element in the list plus one comparison The recurrence relation that depicts the situation is T(nFT( 2 ) +1 where "n" denotes number of element present in the list Assume that if the list has only one element the algorithm will do zero division. This implies T ( 1) = 0 Relation between the number of comparision and number of division in worst case Choose In worst case how much time total time is required for division and compansion if there are 16 elements in the list.? Choose . How many comparision is needed in worst case? Choose