If a dynamic programming problem can be expressed in terms of building up an n × n table with each entry depending on al

[answerhappygod]

If a dynamic programming problem can be expressed in terms of
building up an n × n table with
each entry depending on all the entries before it in it’s row and
some entries above it in it’s column
(with a constant amount of arithmetic done with each entry
accessed, for instance finding the minimum
of those entries), then the run time of the algorithm is