Help with these 2 please. Its fill in blank for java

9. (10 points) Fill in the blanks so that the following method can do merge sort void merge (int leftFirst, int lettlast, int rightPirst, int righttast) int indexleftFirst int saveFirst leftFirst: while ((8.1) if ((8.2) tempArraylindex++] - alleftFirst++ else temprraylindex+l - atrightFirst++ while ((8.3) Copy rest of left halt tem pArray [ index++] -alleftFirst+.. while ((8.4) ) // copy rest of right half tempArraylindex+-alrightFirst) for (index - saveFirst: index rightiast: index+.) a [index) - tempAtraylindex)a void mergesort (int left, int right) if ((8.5), int middle (8.6) mergesort (first, (8.7) last): mergesort ((8.8) (8.10) last) (8.9) , merge (first, Page 6 of 9