PLEASE ANSWER MANUALLY FIRST IN Bellman-Ford's Algorithm TO THE BELOW QUESTION AND THEN IMPLEMENT A PYTHON CODE FOR THE QUESTION AND PLEASE SEND THE PROPER CODE WITH SCREENSHOT OF OUTPUT:

743. Network Delay Time (Bellman-Ford's Algorithm) - LC - Medium

Process

Step 1: Solve this problem manually using this procedure.

Step 2: 743. Network Delay Time 50.3 (local copy)- Medium

We will send a signal from a given node k. Return the minimum time it takes for all the n nodes to receive the signal. If it is impossible for all the n nodes to receive the signal, return -1.

Implement the Python code and test all the test cases described on 743. Network Delay Time. Please also test the example shown on

Step 1:

Input: times = [[A,B,1], [A,D,2], [B,C,2] [D,C,2] [C,E,8] [D,E,3] ], n = 5, k = A

Output: 11