Consider the following algorithm:

for $($i $=1$ to n$)$

for $(\}$j$=1\backslash$mathrm$\{$ to m$)$

for $($ k $=1$ through $1000)$

Task A

If Task A requires $t$ time units, the algorithm requires

time units to be executed in the

worst case.

a$.O(t)$

b$.O((1000+m+n{)}^{*}t)$

c$.O(1000*t)$

d$.O(n^{*}{m}^{*}t)$

e$.O(1000+n+m+t)$