a. Section 1: The pseudo code of the bubble sort algorithm i. The input is a list of unsorted integers (A) ii. The return is a list of sorted integers (B) b. Section 2: The pseudo code for an algorithm that verifies the correctness of a sorting algorithnm i. The inputs include 1. A list of unsorted integers (A) 2. A list of integers sorted by any sorting algorithm (B) ii. The return shall indicate whether B is correct ii. In this algorithm, you can call existing sorting function in Python to sort A, and then compare two c. Section 3: The pseudo code for a function that tests the i. The input is the total number of integers to be ii. The return is the amount of time used to sort N ili. You will need to generate an array of N random iv. To determine the amount of time for sorting, you sorted lists to see if they are identical time complexity generated (N) integers integers need to record the time before and after you call the sorting function. d. References