what is the difference between O(nk) and O(n+k) in time complexity?

Question

In big O notation of time complexity in algorithmic analysis, when an algorithm depends on n and k, what is the difference between these two notations. Also pls help in the

Answer 1

O(nk):

for( i=0; i

O(n+k):

for( i=0; i