This is my 3rd time posting this. please give me the wright solution and code . also post the screen shoot. I will upvote it .

The following Tree datatype implements a binary tree with a number in each node and leaf: (define-type Tree (leaf [val : Number]) (node [val : Number] [left : Tree] [right : Tree]))

Please use plait in Racket . Need this as soon as possible. Thanks .

--------- Positive tress?

Implement the function positive-trees?, which takes a list of trees and returns \#t if every member of the list is a positive tree, where a positive tree is one whose numbers sum to a positive value. Hint 1: This function takes a list, not a tree, so don't try to use the template for a tree function. Hint 2: Use your sum function as a helper. Hint 3: (positive-trees? empty) should produce \#t, because there's no tree in the empty list whose numbers sum to 0 or less. More examples