Select all true statements about the worst$-$case running time of the Merge algorithm to merge two sorted arrays of length $n$ and $m,$ respectively.

The worst$-$case running time is proportional to min$(n,m).$

The worst$-$case running time is proportional to $n+m.$

The worst$-$case running time is proportional to $n*m.$

The worst$-$case running time is proportional to max$(n,m).$