(from Er) Consider the following simpler alternative to splaying: MoveToRoot(v): while parent(v) != null single rotate at v Prove that the amortized cost of MoveToRoot in an n-node binary tree can be N(n). That is, prove that for any integer k, there is a sequence of k MOVETORoot operations that require 12(kn) time to execute (from Er) Consider the following simpler alternative to splaying: MoveToRoot(v): while parent(v) != null single rotate at v Prove that the amortized cost of MoveToRoot in an n-node binary tree can be N(n). That is, prove that for any integer k, there is a sequence of k MOVETORoot operations that require 12(kn) time to execute