I need help with these two problems. the book we use is called essentials of programming languages "https://karczmarczuk.users.greyc.fr/TEACH/Doc/EssProgLan.pdf" . Also this is supposed to written in #language eopl inside of Dr.Racket. Thank you.

Exercise 1.34 [k**] Write a procedure path that takes an integer n and a binary search tree bst (page 10) that contains the integer n, and returns a list of lefts and rights showing how to find the node containing n. If n is found at the root, it returns the empty list. > (path 17 (14 (7 () (12 () )) (26 (20 (17 ) ()) (right left left) Exercise 1.35 [***] Write a procedure number-leaves that takes a bintree, and produces a bintree like the original, except the contents of the leaves are numbered starting from 0. For example, (number-leaves (interior-node 'foo (interior-node 'bar (leaf 26) (leaf 12)) (interior-node 'baz (leaf 11) (interior-node 'quux (leaf 117) (leaf 14)) should return (bar 0 1) (baz 2 (quux 3 4)))