write a python pseudocode for the algorithm and a runtime

a. There is a straightforward algorithm that admits a running time of O(n^2 ), where n is the length of time. Describe the algorithm and explain why it has time complexity O(n^2 ). Hint: try to compare every pair of talks time.

b. There exist more efficient algorithms that have running time O(n log n). Describe such an algorithm. The criterion is same as (a). Hint: first sort the talks by their starting time and then iterate through the sorted list.

= The starting time and ending time of the talks that Alice wants to attend are stored in an array denoted by time, where time[i] = [start_i, end i) is the schedule of the i-th talk. We want to design an algorithm to see if Alice could attend all talks specified in the time array. Example 1: Input: time = [[0,40],[45,90],[80,120]] Output: false # In this example, Alice cannot attend both the second and the third talk as they are partially overlapped. Example 2: Input: time = [[0,40] , [45,90],[100, 140],[150, 180]] Output: true # In this example, Alice can attend all the talks. # If the starting time of one talk and the ending time of another talk are the same, we say there is a time conflict and Alice cannot attend both talks