merge sort

" A Aa A SERIE EE 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). (i) How many times will the first while loop iterate? while (left_index of 95 merge pseudocode algorithm Merge: Input: vector vec of integers, left index, middle index, right index Side Effect: sorted vecs from left to middle and middle + 1 to right are merged left_vec = new vector of elements from left to middle right_vec = new vecton of elements from middle + 1 to last left index = , right_index - e, merged_index=left while left vec and right vec both still have elements: if left_vec left Index]. c.right_vec[right Index: veci merged Index] left vec(left_index] increment left_index and merged index else: vecmerged index) e right_vectighl_index Increment right_index and merged index - Recu.pdf Homework 4 Basic.pl Project 2 Recursive pat Por - here to search 0 5094/es/folder/Lecture%20Slides?preview=1776102. Page