There is mountain with a popular hiking trail. At one point on the trail, the path narrows so that only a single hiker can pass through at a time. When several hikers arrive at this point simultaneously. two queues can build up: one for hikers ascending the mountain and one f hikers descending. It takes each hiker one second to pass completely through the narrow portion of the trail. If all the waiting hikers are all going the same direction (either ascending or descending), then they can immediately begin passing through one at a time, in the order of their arrival. When hikers going in both directions are waiting, then local custom dictates the following procedure for determining which hiker has priority (i.e., gets to pass through first): - If in the previous second, no hiker passed through, then the first waiting descending hiker gets to go first - If in the previous second, a descending hiker passed through, then the first hiker in the descending queue goes first. - If in the previous second, an ascending hiker passed through, then the hiker in the ascending queue goest first. For each hiker, find the time when they will pass through the narrow portion of the trail. Function Description Complete the function getResult in the editor below..