Dijkstra's algorithm

This is a simple project that needs to find length by using algorithms, below is the question : Use Dijkstra’s algorithm to find the length of a shortest path from a to z.. Note this project need to be completed within 3 days and I will pay USD 2.00 and also provide a good comment. Instruction : 1 copy past is not allowed 2. Do not share with others 3. Make sure the coding can be run 4. Once a task completed and verified by our team, i will pay and provide the commentary (within 24 hours) Please find attached file that contains question/ task.