(15 pts) For a B+ Tree where M=3 and L=5 shown below, show how an insert of 77 is handled. Use the method of splitting vs redistributing 24 | 75 || 10 || 16 || || 41 | 50 | 84 | 50 84 -OS 16 18 20 24 26 30 75 78 79 70 80 (15 pts) Give an equation to calculate the minimum number of nodes in a complete binary tree of height h. This means that every height 1...h-l is completely full. (15 pts) For a B+ Tree where M=3 and L=5 shown below, show how an insert of 77 is handled. Use the method of splitting vs redistributing 24 | 75 || 10 || 16 || || 41 | 50 | 84 | 50 84 -OS 16 18 20 24 26 30 75 78 79 70 80 (15 pts) Give an equation to calculate the minimum number of nodes in a complete binary tree of height h. This means that every height 1...h-l is completely full