Here is the game called Math Effect Black Eye. You are Commander Shepherd and you are given a map of the galaxy: an n n grid { 1, 2, . . . ,n} { 1.2, . . . ,n). You are also given a positive integer SVli.j] for each point (i.j) in the grid that represents the Strategic Value of (i,j). You start at (1,1), the lower-left corner of the galaxy. For each round, you can either move right or up: Denote the current point by (i,j), then you can move to either (i +1,j) or (i.j+ 1). (Of course, you are not allowed to move outside of the galaxy.) Design an algorithm to compute the maximum total SV achievable by any feasible route from