To allow multi-path routing (i.e., the ability to set up alternate paths between any givenpair of hosts), each router node maintains one or more entries of the formhx ! {(pth(x,1), nhop(x,1), p(x,1)), (pth(x,2), nhop(x,2), p(x,2)), . . .in its cost table for each host hx, where nhop(x,i) is the number of hops along the path pth(x,i) to reachhx, and p(x,i) is the probability that a node in pth(x,i) drops a packet (i = 1, 2, . . .). Show mathematicallyhow a routing algorithm may use nhop(x,i) and p(x,i) to select a minimum loss path to a host ?