Also, please explain the reason behind it. Thanks in advance.

1. Identify the worst-case time complexity corresponding to the code segment below. Be sure to take into account the time complexity of any data structure operations used. The time complexity is expressed in terms of variable n. Assume list1 and list2 are Array Lists, each having originally n items, and that there is plenty of unused capacity to store additional list items. 3. Identify the worst-case time complexity corresponding to the code segment below. Be sure to take into account the time complexity of any data structure operations used. The time complexity is expressed in terms of variable n. for (int i = 0; i map = new TreeMap(); for (int i = 0; i set = new HashSet(); for (int i = 0; i 0; i = i / 2) sum++; } System.out.println(sum) ; Select 1 option from question 1<><>