Part A: Incremental Sorting

Question $1$: Algorithm Analysis

For each of the following sorting algorithms, provide:

A detailed explanation of how the algorithm works, using pseudocode.

The time complexity in best$-$case, worst$-$case, and average$-$case scenarios.

The space complexity and whether the algorithm is stable or not.

a$)$ Bubble Sort

b$)$ Insertion Sort

c$)$ Selection Sort