3: (2 points) Consider a B- Tree of order 5, a. What is the maximum number of children for each node? And how many keys for each a non-leaf node (at most)? b. insert the following keys: 3, 14, 7, 1, 8

Please a personal solution, not from the internet, correct and clear
Algorithms

Extracted text: 3: (2 points) Consider a B- Tree of order 5, a. What is the maximum number of children for each node? And how many keys for each a non-leaf node (at most)? b. insert the following keys: 3, 14, 7, 1, 8