Let $G=(V,E)$ be a strongly connected, weighted, and directed graph. Give an algorithm to find the

maximum value $b$ such that for each two vertices $u,v,$ there exists a directed path from $u$ to $v$ with only

edges that weigh at least $b.$ Your algorithm should work in $O(n+$mlogn$)$ time. Here $n=|V|$ and $m=|E|,$

which is a common convention when dealing with graphs.ive a time$-$complexity analysis of any algorithm you present. keep it simple and clear and give time complecity on side for each step.