Question

Please use DrRacket Programming

Write a structurally recursive function named (tails lst) that takes a list as an argument and returns all the sublists of the list. For example:

     > (tails '(1 2 3))
     '((1 2 3) (2 3) (3) ())
     > (tails '((a b) (c d)))
     '(((a b) (c d)) ((c d)) ())

Think carefully about what the function should return if it receives the empty list as an argument.

Finish this template:

(define tails
(lambda (lst)

Answer 1

Code:

(define tails
(lambda (lst)
(cond ((null? lst) '(())) ;;if list is empty returns '(())
(else (cons lst (tails (cdr lst))))))) ;;else recursively cons the sub lists

Snapshot of Code and Output: