a) Explain (step by step, showing each iteration) how the Bellman-Ford algorithm can be used to solve the following constraints where each xi is an integer variable: x1x2=3x2x44x3x41 b) What is the worst-case asymptotic time complexity of using the Bellman-Ford algorithm to solve n equality/inequality constraints of the following forms xixj=wijxixjwijxixjwij where xi and xj are integer variables and wij is an integer, as in the example in (a) above? Please explain. c) Explain (step by step, showing each iteration) how the Floyd-Warshall algorithm (or its slight variation) can be used to compute the Transitive Closure of the digraph with vertices {1,2,3} and edges {(1,3),(3,2)}