8. [4 marks] What statement is true about the data structure (2,4)-tree: A. It is a tree whose each internal node has at least 1 and at most 3 children. B. It is a tree whose each internal node has exactly 2 children. C. It is a tree whose each internal node has at least 2 and at most 4 children. D. It is a tree whose each internal node has at least 1 and at most 2 children. E. It is a tree whose each internal node has exactly 4 children