Assignment 1 - Manhattan Tourist Problem Instructions: Turn in an algorithm or a complete C++ program that can be used to solve the Manhattan Tourist Problem using dynamic programming. Option 1 - Algorithm (Maximum Grade = 100): Algorithm requirements: 1. List the steps of the algorithm in the form of an outline (not paragraphs). 2. The algorithm needs to have at least 3 loops and / or 3 recursive functions. For each loop / recursive function define: a. What will cause the loop to end? Alternatively, what will cause the function to stop calling itself? b. What work is done during each loop iteration? Alternatively, what work is done during each function call? 3. The paper needs to be done individually. 4. This paper needs to be saved in one of the following file formats: .doc, .docx, or .pdf. [Example) Your name CS 3304 Assignment 1 - Manhattan Tourist Problem [List the steps in the form of an outline.] Step 1: Step 2: Step 3: Step i: While (Condition is true) Sub-step A: Sub-step B: Step N