#lang racket ; Returns the sum of the digits of integer n. ; You may use the modulo function. (modulo x y) (define (sum-digits n) 0) ; Returns n!. (define (factorial n) 0) ; Returns the nth number in the Fibonacci series. (define (fib n) 0) ; Returns #t if n is prime and #f otherwise. ; The first function shown is a helper function. (define (prime?-help n i) #f) (define (prime? n) (prime?-help n 2))