Show that if all nodes in a splay tree are accessed in sequential order, then the

total access time is O$($N$),$ regardless of the initial tree.