Compute the value returned by mystery () on some sample binary trees and then formulate a hypothesis about its behavior and prove it.

public int mystery (Node x) { } if (x==nul1) return 0; return mystery(x.left) + mystery (x.right);