Please answer all parts of the question, thanks **Constructing a B+ Tree of Order P=4****Objective:** Build a B+ Tree for the following set of key values:- Key Values: (7, 12, 5, 20, 1, 18, 24, 21, 30, 4, 13, 15)### Steps:**a) Initial Construction:**- Begin with an empty B+ Tree.- Insert the keys in the order given: (7, 12, 5, 20, 1, 18, 24, 21, 30, 4, 13, 15).- Task: Display the final B+ Tree after inserting all the above keys.**b) Additional Insertions:**- After completing the initial tree, insert additional keys in this order: 14, 16, 17.- Task: Display the final B+ Tree after inserting these keys.**c) Deletions:**- Proceed to delete keys in this order: 17, 12, 13, 16.- Task: Display the final B+ Tree after performing these deletions.### Instructions:- Always maintain the order P=4, which dictates the number of children nodes.- Ensure that each step maintains the properties of a B+ Tree.- Visualize each step to understand the structural changes.This exercise helps in understanding the dynamic nature of B+ Trees in handling insertions and deletions while maintaining balance and order.

Constructing a B+ Tree involves a series of insertions and deletions while maintaining the properties of a B+ Tree. I'll guide you through each step based on the given order of keys.1) Insert keys in the order: 7, 12, 5, 20, 1, 18, 24, 21, 30, 4, 13, 15b) Insertions: 14, 16, 17c) Deletions: 17, 12, 13, 16This are the final B+ Tree after all insertions and deletions.

Answered: Construct a B+ Tree of Order P=4 For…