Answer Happy

please solve it as Python, use recursion
Scavenger Hunt Function Name: scavengerHunt() Parameters: directions ( list ) Returns: distance_to_prize ( int ) Description: Given a list of directions, signified by strings (either, recursively find the distance from our starting location. signifies a +1 direction towards right, while signifies a −1 direction towards left. ≫> scavengerHunt(['right', 'left', 'right', 'right', 'right']) 3 # right + left + right + right + right =+1−1+1+1+1=3 ≫> scavengerHunt ([′left′, 'left', 'left', 'right']) −2 # left + left + left + right =−1−1−1+1=−2