9:27 AM ? faculty.uca.edu ..ooo AT&T? Acquirement: Both Greedy and Dynamic programming are basic strategies of algorithm design. In this project, you are asked to implement, and test a greedy algorithm (Dijkstra's Algorithm) anda dynamic programming algorithm (Bellman Ford). Graphs are broadly used in modeling real world applications. You can use the prototype of the abstract data type (ADT) graph developed in previous project and further extend it. Project Objective: In completing this project, you will further develop your ability to i. Simplify and solve real world problems; 2 Apply the existing algorithms into real world applications; s Design reasonable software solutions; Implement and verify potential solutions; s. Collaborate with team members. Due Dates and Honor: This Programming Project will be due by the beginning of the class on the date announced in our course website. You need complete it within a team of two/three. You must clearly specify contributions of each team member in the project report. It is very important that you understand and abide by the policy concerning programming projects. Remember, your personal honor and integrity is far more important than your grade on a project. What to submit: You should submit A brief report that documents the process of the project and the results of your experiments Speech Language of s Science code of your p soft copy) HMath-Comp ade Prince comocthy, Maintenance lice ine cALister oorrectly, tudent Health Business ak Treeispeerly