(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 12(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 12(n). That is, prove that for any integer k, there is a sequence of k MOVETOROOT operations that require 12(kn) time to execute