write a procedure in scheme programming and let compile in DrRacket or emacs

Exercise 4.10: leftmost Define a procedure leftmost that takes a nonempty list as its argument and returns the leftmost atomic item in the list. Test your procedure on: (leftmost '((a b) (c (d e)))) = a (leftmost '((((c ((e f) g) h))))) = (leftmost '(() a)) => ()