Need help pinpointing issue with this code. Thank you.

2. (15 points) What is the issue with the following merge sort code? 1: int merges(int st, int en, int * x) 1 2: int mid- (st + en) / 2, i; 3: 4:int vals[en st 1]; 5: merges(st, mid, x); merges (mid + 1, en, x); 6: if (st-en) int frontPtr = st, backPtr = mid + 1, mergedPtr = 0; return 9: while (mergedPtr