ANSWER IN RACKET LANGUAGE Write a structurally recursive function in Racket (positions s los) that takes two arguments, a symbol s and a list of symbols los. positions will return a list that contains the zero-based positions of all occurances of s in los ex: > (positions '1 '(1 2 1 3 4 1 5 6) (25) Make positions an interface procedure that calls a structurally recursive helper function with the symbol and list of symbols as the first two arguments, and an initial value for the counter as the third ANSWER IN RACKET LANGUAGE Write a structurally recursive function in Racket (positions s los) that takes two arguments, a symbol s and a list of symbols los. positions will return a list that contains the zero-based positions of all occurances of s in los ex: > (positions '1 '(1 2 1 3 4 1 5 6) (25) Make positions an interface procedure that calls a structurally recursive helper function with the symbol and list of symbols as the first two arguments, and an initial value for the counter as the third