Is it possible to find maximum bottleneck capacity path in O(|E|log|V|) time

Question

I have been struggling with this for a bit now. I want to find the maximum capacity path (also known as widest path) of a flow network. So a path with the largest minimum ed