Problem 1 In this problem, we want to sort an input array. Problem 1A (easier) In this problem, develop an algorithm that, given an unsorted array, creates a new array which is the sorted version of the given array. Here is the main idea of the algorithm: first scan through the original input array, finding the smallest element, and then insert this element into the beginning (index 0) of the new array, and remove this smallest element from the input array. Next, scan the (shortened) input array again, finding the smallest element, and then insert it into the next available position of the new array and remove it from the input array. Repeat the process until the original array becomes size 0 (also the new array contains all the values in the original input array). Develop flowchart for this algorithm, Hint: you will need nested loops for doing the work in one main algorithm. You can also write a sub- program to do some work. In this case the main algorithm has one loop. Hint: to find the smallest element in an array, define a variable, say, minIndex, which is initially 0, then if an element at index k of the array is smaller than the element at index minIndex, update minIndex to be k. For removing an element at index k from array arr, you can just say "remove element at index k from arr", or "remove arr[k] from arr" Start your flowchart as shown in the following picture, which first get an input array arr, and then create new array newArr. Save the flowchart as img_01A.jpg start arr[] newArr []