Activity 1: (Proof of Completion Due 11/05) (B+-tree operations) Perform the follow- ing tasks related to Bt-trees, assuming that n = 4 a) Follow the B+-tree insertion algorithm that we studied in class to insert the fol- lowing entries in order: Harry "Hermione". "Albus" "Severus", "Ronald" "Draco" "Bellatrix", "Rubeus". "Dolores". "Fleur". "sybill. Show your work step by step. b) Now, delete the following entries one by one, following the algorithm we studied in class, and in this exact order: "Bellatrix", "Dolores". "Draco" "Fleur", "Harry", "Hermione". Show your work step by step. "Albus Activity 1: (Proof of Completion Due 11/05) (B+-tree operations) Perform the follow- ing tasks related to Bt-trees, assuming that n = 4 a) Follow the B+-tree insertion algorithm that we studied in class to insert the fol- lowing entries in order: Harry "Hermione". "Albus" "Severus", "Ronald" "Draco" "Bellatrix", "Rubeus". "Dolores". "Fleur". "sybill. Show your work step by step. b) Now, delete the following entries one by one, following the algorithm we studied in class, and in this exact order: "Bellatrix", "Dolores". "Draco" "Fleur", "Harry", "Hermione". Show your work step by step. "Albus