Suppose that you also guaranteed that for all v 2 V, a shortest path from s to v has increasing edgeweights. Give an algorithm to find the shortest path distances from s to every vertex in V. Analyze therunning time of your algorithm and explain why it is correct. For full credit, your algorithm should runin time O(V E logE).

Read these lines from beowulf.often scyld scefing seized mead-benches from enemytroops, from many a clan, he terrified warriors, even thoughfirst he was found a waif, best explains why the author includes this information in theexposition? a. to emphasize that a hero must learn to be fierceb. to remember the famous story of a popular heroc. to express sadness about losing the old heroesd. to see whether people still respect the old heroes