Complete the code segment below by adding the missing code to correctly implement insertion sort. public static void insertionSort (String[] nums) { for (int i = 1; i < nums.length; i++) { int temp = nums [i]; int index = i - 1; } } while (/* missing code */) { nums[index index--; + 1] = nums[index]; } nums [index + 1] = temp; Enter your answer here 2