Question $4$

$10pts$

In the following table $($rows indexed from $0$ to $3,$ columns indexed from $0$ to $4),$ there are $12$ entries in the form nij, where $i=1,2,3$ and $j=1,2,3,4.$ Entry nij denotes the largest integer $n$ such that $f_i(n)$ milliseconds does not exceed $t_j$; where $f_i(n)$ is the function in row$-$ i and column $-0,t_j$ is the time in row$-0$ and column $-.$ For example, for entry $n32,$ we have $f_3(n)=3^n$ and $t_2=1$ minute. Hence $n32$ should be the largest integer $n$ such that $3^n$ milliseconds is no more than $1$ minute.

Enter the values for nij, $i=1,2,3,j=1,2,3,4.$

$\backslash$table$[[,1$ second,$1$ minute,$1$ hour,$1$ day$],[200n+100,n11,n12,n13,n14$