Develop code to implement the "Fake Sort" routine described below. • Given a list of numerical data, create a new list with the data from the original list sorted from minimum to maximum o We’ll call this "Fake Sort" because it’s cheating (a bit) to create a new list while destroying the original list o Here’s the basic algorithm  Find the minimum value in original list  Append value to the new list  Delete that element from original list  Repeat until run out of members in the original list o Now, write a routine to reverse the sorted list