just give me the final answer

$1)$In the context of algorithm analysis, what is the time complexity of the Selection Sort algorithm in the worst$-$case scenario?

$2)$What is a fundamental characteristic of the brute$-$force approach in algorithm design?

$3)$ Which of the following best describes Bubble Sort's basic operational mechanism?

$4)$ Consider an array initially given as $[5,1,4,2,8].$ What would be the state of this array after the $4$th iteration of the Bubble Sort algorithm?

$5)$In the context of algorithm analysis, what does the term "Big O notation" specifically represent?