Use a graph algorithm to solve the following problem. Give a runtime analysis. Determine arbitrage in a currency exchange network. Basically, for every pair of currencies (u, v), you have the exchange rate: given 1 unit of u, how many units of v can you buy with it? Arbitrage occurs when you start with one unit of up, convert that to uz, convert that to uz, ..., convert that to up, and then back to up, and end up with > 1 unit of us