or some positive integers m and n$,$ consider the following mathematical recurrence:

Q$($i$,$ j$)=$

$($

$1$ if i $=1$ or j $=$ n

Q$($i $1,$ j$)+$ Q$($i $1,$ j $+1)$ otherwise

Describe a dynamic programming algorithm that, given m and n$,$ computes

Q$($m$,1).$ Your algorithm should be iterative and of the form:DYNAMIC$($m$,$ n$)$:

$//$ your code here

What$$s the runtime of your algorithm?