Write a C# program to sort a parallel array that consists of customer names and customer phone numbers. The solution should be in ascending order of customer names. For instance, if the input is string[] custNames = { "ccc", "ddd", "aaa", "bbb" }; string[] custIds = { "687-3333", "456-4444", "789-1111", "234-2222" }; then, the solution is string[] custNames = { "aaa", "bbb", "ccc", "ddd" }; string[] custIds = { "789-1111", "234-2222", "687-3333", "456-4444"};

There are some restrictions: 1. Do not use Array.Sort(), List.Sort() methods. Instead, implement your own version of BubbleSort, InsertionSort, or SelectionSort (as discussed in classes) 2. Do not wrap the arrays inside a class. 3. Test the program with the sample data shown above. 4. Print your documented code and screenshots.