Quiz navigation 10 11 12 Note Solve the question in the given text box and then select the most appropriate answer from the given choices Considerar algorithm that divide a esto element in two halves and then do one companion in worst caselt ratively perform the above assuntil there is only one elements mains in the list Let the time requered to divide list of clements in worst case Tintin regard to divide remang har of the element in the stone companion The recurrence relation that depicts the situation Tn PTI na where denotes number of element present in the list Assume that if the has only one clement the algorithm wil do zero division. This implies (1) 19 20 21 Time 12:58:47 Relation between the number of companion and number of disse Choose . woeste how much time is required for den and common there 15 elements in the How many companions needed in 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 w* element in two halves and then do one comparison, in worst case It feratively 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 in time required to divide remaining hart of the element in the list plus one comparision The recurrence relation that depicts the situation is T(n) [ N2 +1 where m denotes number of element present in the list Assume that if the list has only one element the algorithm wil 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 comparision if there are 15 elements in the list? Choose How many companion is needed in worst case? Choose