Assume there is an algorithm whose time complexity is given by the equation f$($n$)=6$n$2+15$n $+75.$

a$.$ Prove that f$($n$)=($n$2)$ by using the formal definition of the big $($theta$)$ function