How do I do this?

Given an integer, insert it into an already sorted array so that the resulting array is still sorted. Arrays will be and should be sorted in ascending order. If the original array is empty, return an array containing the one new value. sorted insert (5, [2, 2, 3, 6]) rightarrow [2, 2, 3, 5, 6) sorted insert(5, [2, 2, 3, 5, 6]) rightarrow [2, 2, 3, 5, 5, 6] sorted insert (7, []), rightarrow [7] Save, Compile, Run int[] sorted Insert (int n, int [] nums) {