Suppose you are given three large $($positive$)$ integers m$,$ n$,$ and k$,$ where m $>$ n $>$ k$,$ and you$$

need to use an $$efficient$$ algorithm to calculate the value of the expression $($m$+$n$)$k $($i$.$e$.,$ m plus n first, then multiply the sum by k$).$ Which of the following Big$-$O expressions best estimates the time complexity involved in this calculation?

Group of answer choices

O$(($m$+$n$)($log k$))$

O$(($log m$)($log m$))$

O$(($log m$)$k$)$