You are given a weighted graph G and two designated vertices s and t. Your goal is to find a path from s to t in which the minimum edge weight is maximized, i.e., if there are two paths with weights 10 ->1 -> 5 and 2-,>7->3 then the second path is considered better since the minimum weight (2) is greater than the minimum weight of the first (1). Describe an efficient greedy algorithm to solve this problem and show its complexity. Prove its correctness.