How can I define a function in SML to split a tree into its i rightmost elements and the rest?

Question

splitTree : tree * int -> tree * tree Hi, I need to define a SML function so that, given a non-negative number i and a tree t containing at least i elements, the call splitTr