merge sort

" A Aa A EEEE ALI ADA AaBbCcDc AaBbCcDc Aal 1 Normal 1 No Spac... Hea St Paragraph I . Let's say we call the Merge algorithm on the vector (2,4, 1, 3} (with left = 0, mid=1, and right = 3). (0) How many times will the first while loop iterate? while (left_index #include &vec) { std::cout right_vec(right_size, 6); for (int j -e; j right_size; j++) { right_vec[i] vec[mid + 1] 25 int left_index ant right_index B; int merged_index left; while (left_index