4. [6 points] Given the weighted graph (Figure 1) and a destination vertex, find the lowest cost path from vertex to the destination using the Bellman-ford algorithm. [To get full points, you must show all the individual steps involved in the algorithm, marking the vertices chosen, current edme value etel Source Node Deshination N6