Please explain the reason behind it. Thank you.

log linear quadratic cubic exponential 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. a) int sum = 0; for (int j 0; j 0; i = i / 2) sum++; } System.out.println (sum); c. Also, assume that array has n integers and that the size of the HashSet is large enough for optimal performance. Set set = new HashSet(); for (int i = 0; i map = new TreeMap(); for (int i = 0; i <>