So I had a Java program that creates and searches a B tree (see images below), can someone teach me how to write this program in Scheme using Dr.Racket R5RS language?

RootNode 1000 RootNode: 100 RootNode: 200 199 399 LeafNode: 100, 120, 140, 160 LeafNode: 200, 220, 240, 260 RootNode: 300 399 LeafNode: 300, 320, 340, 360 RootNode 1000 RootNode: 100 RootNode: 200 199 399 LeafNode: 100, 120, 140, 160 LeafNode: 200, 220, 240, 260 RootNode: 300 399 LeafNode: 300, 320, 340, 360