Psuedocode Question

Question 6: 12 points
(a) Array A contains n numbers (possibly decimal numbers) in unsorted order representing the 100m
sprint times at the 2020 Olympics. You participated in the race and your time was 10.57 seconds. Write
an algorithm that prints out the next ten times of the athletes who finished just after you. You must
include the pseudo-code and justify the runtime of O(n).
(b) Array B has size n, but the array is only half full. The first n/2 entries are numbers that are
sorted in decreasing order. You have exactly 10 numbers stored in C[1,…, 10] that need to be added
to B. Once those numbers have been included, you must print out the largest 20 numbers. You must
include the pseudo-code and justify the total runtime of O(logn).