In this report, you have to answer the following questions:

Sorting:

a$.$ You are required to search$/$study$/$report $3$ new sorting

algorithms. For each algorithm illustrate how it works with an

example and code of the functions, state the time and space

complexity of various scenarios $($if the data is generated at

random, if the data is sorted ascending, or if the data is sorted

descending$).$

Dynamic Programming:

a$.$ What is Dynamic Programming?

b$.$ Mention three problems that can be solved using Dynamic

Programming.

c$.$ Show an example of a code that solves a problem using Dynamic

Programming and without using Dynamic Programming.

Your final report should include:

Your student name, student ID$,$ and section number.

A final page contains the used references in your report.

The following methods should not be in your list:

Insertion

Selection

Bubble

Shell

Merge

Heap

Radix