seamcarving clarification (theory)

For 2(f)(i), you can just let T(n) be the runtime of Stack(n) (not the solution to finding the tallest stack). If you do it the other way, you'll still receive credit. For 2(f)(ii), 2(f)(iii), you should actually try and find the tallest stack, not just compute Stack(n). Sorry for the confusion.