PART $2-$ Comparing the orders of growth between two algorithms $(2*3=6$pts$)$

Say we have two different algorithms with respective runtimes of f$($n$)$ and g$($n$).$ Given the following cases, prove whether or not f$($n$)$ is O$($g$($n$))$ in each case.