a$)$What is the RAM model of computation? $(10$ marks$)$

b$)$what is algorithm asymptotic analysis?$(5$ marks$)$

c$)$ define big$-$O notation $(5$ marks$)$

d$)$ suppose the worst case time complexity of an algorithm is T$($n$)+5$n $^2+10.$ Provide a function that is a big $-$O bound to the running time of this algorithm. Prove that your answer is correct $(5$marks$)$