Problem 2 (15 points Insertion Loop) Write a java code fragment (not an entire method!!) that would insert the value contained at ar[4] (denoted by X) into the sorted array ar[0:3]. That is, when your code is done, ar[0:4) should be sorted. Ten points will be deducted for any solution that sorts the entire array. 0 0 1 2 3 23 31 45 53 X 4