Suppose a node p is inserted into a splay tree. We know that p ends up at the root. If r was the original root $($before insertion$)$ What is the shallowest and deepest level that r could end up at after insertion of p$?$ Assume the root is level $0.$ Justify.