Notes: 1. The assignment should be submitted by the due date a6d time (Late Assignments will not be accepted for any reason). 2. The assignments are individual effort and copying the assignment will be treated as a cheating attempt, which may lead to FAILING the course. Consider the following sorting algorithms. 1- Selection sort 2- Bubble sort 3- Insertion sort A) Write the pseudocode of each algorithm and the time complexity (show your work). B) Write these algorithms in Python language and record the running time of each one. Test these algorithms on random array with size of 500. Fill your results and answers in the following table. (just fill in the same table and don't change the template). Insertion sort Runnin Complexit y Bubble sort Runnin Complexit Selection sort Runnin Complexit y Algo. Time Result S Note: Return your work along with your code file (.py)