write down the serch region for each iteration of the binary serch algorithm, when the target element is 17, and the list is :

[2,3,4,6,8,9,15,20,21,31,40,43]

write your answer as a list containig. the serch region for each iteration, starting from iteration one, and ending when the algorithm stops.

for example if the search region for iteration 3 is between index 2 (inclusive) and 4(includsive), you write your answer for that iteration as;

iteration 3: [4,6,8]