Consider an empty binary search tree T that has keys 37, 22, 23, 45, 39, and 51 in that order. Imagine then calling Tree-Delete(T, z) where z is the node with key 23. In the resulting tree, if x is the node with key 37, what is the key of x.p (x's parent)?