Devise a series of equivalence statements for a collection of sixteen items

that yields a tree of height $5$ when both the weighted union rule and path

compression are used. What is the total number of parent pointers followed

to perform this series?