6) Do all in Haskell Please

For the following program, give the value that ans will be assigned after evaluation. Show each recursive call with appropriate substituted values.

myFunction [] = 0

myFunction [(a,b)] = a + b

myFunction ((a,b):(c,d):rest) = b + d + (myFunction rest)

ans = myFunction ( map (\x -> (-1,x)) [1,2,3,4,5] )