detailed explanation please (Java)

Question 4 (1 point) Give a tight lower bound on the time complexity of the following algorithm. You can assume that the input list has n elements and that insertions Sort() sorts the input list using the insertion sort algorithm you have learned in class. mystery (list) { X = new array list end 1 for (i = list.size()/2 ; 1 > 0; i = 1/2) { new array list for(j 0; j