first image after the question is the code i currently have and i need to create a code for isBinaryTree. the rest of the pictures are the test that the code must pass.

8. (10 Points) Write a recursive method isBinarTreel0 that takes a Node as argument and returns true if the subtree count field n is consistent in the data structure rooted at that node, false otherwise. Provide your implementation inside Node class isBinarvTree method