01 100413750_AAUP - JENIN) / My courses / DISCRETE MATHEMATICS Section1 Lecture (20201_10041375 Time left 1:57 3 If each vertex in a tree has at most n offspring, then the tree is called of O a. A complete n-tree O b. A binary tree stion O c. Operational tree O d. An n-tree page Next pa