Hackor Rank 27 2. Gridland ALL Grdland is a 2 world divided into cells. Each cellis described as an coordinate within the top left corner. From some celyn Inhabitant can move the horizontally or verticaly to an adjacent call 1 yorixy..tach posible minimum path is defined as a sequence of horrowland vertical moves denoted by the characters and . For example, the path string HVMV describes the following sequence of moves from 0 to 22 horizontal -- vertical horisontal-vertical Language C Autocomplete Ready 1> #include chits/std. 9 10 / 11 . Complete the "getSafePaths' function below 12 . 13 The function is expected to return a STRING ARRAY 14 The function accepts STRING ARRAY Journeys as parameter 15 */ 16 17 vectorestring petsafePatha (vector 20 21 tot main() Aspecific path through Gridand must be determined. Begin by creating possible paths from the origin to the target location represented as wrings of and order the strings alphabetically ascending Return the path at the zero based index position of a venky value the sale 2 Example journeys 10,7719 Poble moves in the order of lexicographically smallest to largest 1 1 0 OR 0 O1 . 1 1 BV There hard and the move is from position to L.) A pare 0-1)+(1.1) HV and 0+10-CU "Sorting those paths the key value is the awer is the wr. be Function Description Complete the fundier getdatefactes in the editor Pathshes the followme parameter je narray of strings of the space separated . destruction, by index Ratu Test Results Custom Input