Write an algorithm to sort elements in an array with selection sort in pseudocode. You will be given an array, and you need to sort the elements in ascending order. ps: Some things to keep in mind: sorting is not required if the given array has a length of 0 or 1. You should take care to ensure that you start with the smallest element, and swap it to the front of the array. From there, compare each successive element with all previous elements and place them correctly, repeating the process until it's all sorted. ======================================================================================= Write an algorithm to sort elements in an array with insertion sort in pseudocode. You will be given an array, and you need to sort the elements in ascending order. ======================================================================================= Write an algorithm to sort elements in an array with merge sort in pseudocode. You will be given an array, and you need to sort the elements in ascending order. ======================================================================================= write some pseudocode for how you'd accomplish a bubble sort as described above. Think in terms of loops, conditionals, and an array of values. It might help to write some numbers down on a piece of paper, and think about the steps that a computer would need to take in order to properly compare and swap the numbers. You might also want to think of an end condition, depending on how you plan to implement your loops.