Write a function that def mincoursesmemo(n). assume n is fixed and memo table T[0],...,T[n] should store the value of min courses for Jane to reach to the end. You must return a number. (For 9 the value should be 2, 43 the value should be 5)

Question 1: Dynamic Programmer Jane's Progress Note: There is an accompanying set of images that should be placed in the same directory as this notebook. We are writing a simple game Al for guiding our Jane the dynamic programmer to jump through a set of levels to reach a target level by taking courses in dynamic programming. The levels positions are numbered 1, ..., n. The character starts at level 1 and the goal is to reach level n (where she becomes a d.o. ninja) and thus aces CSCI 3104. After taking a course, she can choose to move up by 1, 4, 5 or 11 levels forward at each step. No backward jumps are available. Level 1 Level 2 Level 3 Level 4 Level n Your goal is to use dynamic programming to find out how to reach from level 1 to level n with the minimum number of courses