Assume that for some binary tree node implementation, a pointer requires $8$ bytes and a data object requires $25$ bytes. Further assume that we are storing a Full binary tree, that the internal nodes are implemented to store two pointers and a data field, and that the leaf nodes store only a data field. Type a fraction $($like $"1/2")$ that represents the fraction of the total space taken up by overhead. Give your fraction in lowest terms.

Please explain how to slove this problem, thank you