Morty needs to retrieve a stabilised plumbus from the Clackspire Labyrinth. He must enter the labyrinth using Rick's inter-dimensional portal gun, traverse the Labyrinth to a plumbus, then take that plumbus through the Labyrinth to a fleeb to be stabilised, and finally take the stabilised plumbus back to the original portal to return home. Plumbuses are stabilised by fleeb juice, which any fleeb will release immediately after being removed from its fleebhole. An unstabilised plumbus will explode if it is carried more than 137 flinks from its original storage unit. The Clackspire Labyrinth smells like farts, so Morty wants to spend as little time there as possible. Rick has given Morty a detailed map of the Clackspire Labyrinth, which consist of a directed graph G = (V,E) with non-negative edge weights (indicating distance in flinks), along with two disjoint subsets PCV and FCV, indicating the plumbus storage units and fleebholes, respectively. Morty needs to identify a start vertex s, a plumbus storage unit p e P, and a fleebhole Se F, such that the shortest-path distance from p to s is at most 137 flinks long, and the length of the shortest walk s * p*fs is as short as possible. Describe and analyse an algo(burp)rithm to so(burp)olve Morty's problem. You can assume that it is in fact possible for Morty to succeed.