8. (5 marks) (Short question.) Consider the unoptimised version of the union-find data structure, in which a sequence of n operations takes O(nlogn) time rather than O(n(n)) time. A user creates a new instance of the structure with MakeUnionFind (1,,100), then applies ten Union operations to the resulting data structure. Without knowing the values of those Union operations, what is the greatest possible depth of any tree component of the resulting data structure? A. 1 . B. 2 . C. 3 . D. 4. E. None of the above