Please write in DrRacket scheme.

$[40$ points$]$The grammar below represents a binary tree. Use define$-$datatype to define a datatype called bintree for the binary tree that is represented by the grammar.

Bintree ::$=($Int Bintree Bintree$)$

Use bintree and its constructor procedures to construct a binary tree with $3$ nodes that are integers $7,12,$ and $13$ where $7$ is the root and $12$ and $13$ are left and right subtrees of the root.