Develop a function called bounds

Problem 1.1
(a) Develop a function called bounds which takes a nested list of numbers as its only
argument (i.e. a tree). Bounds should return the largest and smallest value in the tree.
For example:
(bounds ‘(1 (-2 17 (4)) -8 (-6 13)))
==> (-8 17)
(b) As problem 1.1(a) but the tree may contain mixed values (not only numbers).
Problem 3.1: Sliding doors
This scenario is concerned with doors. Doors can be in different states (open or
closed,
locked or unlocked). Doors connect rooms and are un/locked with specific keys.
Specify and build the following operators…
• open (an unlocked door)
• close (a door)
• lock (a door with a key)
• unlock (with a key)
• move (from one room to another)