using python code do this

Greedy

Create an activity selection problem using a very large n$,$ where n is the number of entries. Recall that each entry will have a start time and an end time. It is up to you to determine an appropriate start and end time $($overall and individually$).$Implement the following two approaches to solve the activity selection problem you created:

$1)$Brute Force

$$attempt all possible solutions and return the best one

$2)$Greedy

Calculate the execution times,report,and analyze them.

Divide and Conquer

Create an array with both positive and negative values using a very large n$,$ where n is the number of elements in the array. It is up to you to determine the size of n to adequately demonstrate the effectiveness of the

divide and conquer algorithm.

Implement the following two approaches to the maximum subarray problem

you created

:

$1)$

Brute Force

$$

attempt all possible solutions and return the best one

$2)$

Divide and Conquer

Calculate the execution times,report,and analyze them.

also,What is timsort? Can you implement it$?$

Create an activity selection problem using a very large n$,$ where n is the number of entries.

Recall that each entry will have a start time and an end time. It is up to you to

determine an

appropriate start and end time $($overall and individually$).$

Implement the following two approaches to solve the activity selection problem you created:

$1)$

Brute Force

$$

attempt all possible solutions and return the best one

$2)$

Greedy

Calculate the execution times

$,$

report,

and analyze them.

Divide and Conquer

Create an array with both positive and negative values using a very large n$,$ where n is the

number of elements in the array. It is up to you to determine the size of n to adequately

demonstrate the effectiveness of the

divide and conquer

algorithm.

Implement the following two approaches to the maximum subarray problem

you created

:

$1)$

Brute Force

$$

attempt all possible solutions and return the best one

$2)$

Divide and Conquer

Calculate the execution times,

report,

and analyze them.