Using the asymptotic definition of $\Theta(.)$ I need to show that:
$$an\log(n)+3n = \Theta(n\log(n))$$
for some $a$, fixed constant.
My attempt
In order to prove what's above, I need to find a suitable positive $c_1$ and $n_0$ values such that as $\forall n \geq n_0$, then $an\log(n)+3n \leq c_1(n\log(n))$. (And then repeat the same process to show that $\exists c_2 > 0, n_0$ so that $c_2(n\log(n))\leq an\log(n)+3n\;(\forall n>n_0))$.
Since I don't know which value $a$ might take on, I've thought to reason by cases: $a > 0$, $a = 0$, $a \leq 0$.
Let's assume $a > 0$, then let $c_1 = 4a$, $n_0 = 2$: $$an\log(n)+3n \leq 4an\log(n)$$ $$a2\log(2)+3 \leq 8a\log(2)$$ we can see how $\forall n \geq 2$ that inequality still holds.
Let's now assume $a = 0$, then let $c_1 = 4a$, $n_0 = 2$: $$4n \leq 4n\log(n)$$
Lastly let's assume $a < 0$, then let $c_1 = 4$ and $n_0 = 1$:
$$an\log(n)+3n \leq 4n \log(n)$$
then it is trivial because the left side of the inequality is always going to be negative and therefore smaller than the right side which is a positive quantity.
And that shows that $an\log(n)+3n = O(n\log(n))$. Is my reasoning sound? Have I made any mistakes? Any feedback is highly appreciated.