$(4$ points$)$ Bellman$-$Ford algorithm can find shortest paths from $s$ to each vertex in a directed graph $G=(V,E)$ where edges can have negative weights. The algorithm successfully computes shortest distances and outputs True if there is no negative weight cycle reachable, otherwise False. Describe the algorithm. You only need to compute the shortest distance from $s$ to each vertex.