Scheme programming

Create a recursive procedure called (sumOdds Ist), where Ist is a list of numbers. The procedure should return the sum of all odd numbers on the list. When the list is empty, the result should be 0. 5.1) Use a named procedure called (sumOdds Ist) to implement task. Test case: (sumOdds (1 3 456-7)) 2 [5 points] 5.2) Use an unnamed procedure to implement task. ((lambda (Ist) (add code here) (1 3 4 5 6 -7)) where the list (1 3 4 5 6 -7) is the argument. [5 points]