during an NP hard problem's theoretical complexity analysis, I am stuck at this term.
$O(2^{o(n)})$
In particular:
$O(2^{n-o(n)})+O(2^{o(n)})$
I end up at an answer $O(2^n)$ equating $O(2^{o(n)}) = O(2^n)$ by considering the worst case for the $o(n)$ as $n$.
Any push forward with a proof would be very helpful.
Edit: Changed the power term from Big-O to Little-ο. Thanks @Kenta S for the comment.