8. For the B+-Tree where M=3 and L=5 shown below, show how an insert of value 13 is handled. || 12 || 50 || / | \ / | \ 2 12 50 5 18 65 7 20 70 9 21 72 10 24 78 10 points 9. For the B+-Tree where M=3 and L=5 shown below, show how an insert of value 71 is handled. || 24 || 75 || / | \ / | \ / | \ || 10 || 16 || || 41 || 50 || || 82 || 90 || | / \ / | \ | \ \ / | | | | \ | | | 2 10 16 24 41 50 75 82 90 5 11 18 26 42 65 78 83 92 7 14 20 30 45 70 80 86 93 9 15 21 33 47 72 81 89 95 35 48 73