Question $9$: Write down an example of an $O(n)$ complexity code in python

Question $10$: Name $2$ types of algorithms mentioned under the Divide and Conquer section

Question $11$: Write down one example of a dynamic programming algorithm.

$[2]$

Question $12$: Describe the push$()$ and pop$()$ operations for a stack data structure

Question $13$: Draw and correctly label the linked list with at least $3$ nodes

$[3]$