$2)$Arguably$,$ the most commonly used asymptotic notation used is frequently Big$-$O$.$ Discuss why this is so

commonly the case.

$3)$Is it true that $(n^3)$ algorithm always takes longer to run than an $(logn)$ algorithm? Explain your answer.

$4)$Answer whether the following statements are right or wrong and explain your answers.

$-2n^2+6^{13}n=O(n^2)$

$-nlogn=O(n)$

$-n^3+n^2+{10}^{6}n=(n^4)$

$-nlogn=(n)$

Please answer these Questions with explanations