// Discrete Mathematics
2. Show your work How many elements can be represented using a complete binary tree having: depth 0, depth 1, depth 2, depth 3, depth 4. In a complete binary tree, each node has exactly two children. (3 points) a. + 2m is 2-1 – b. Using induction, show that the sum of the sequence S : 1 + 2 + 4 + 8 + 18 The first term corresponds to the
OR
OR