Construct a + B -tree that has six pointers (n=6) in one node by performing a series of insertions for the following set of key values: (17, 15, 3, 21, 13, 25, 7, 19, 5, 9, 11, 27, 1, 23). Assume that the tree is initially empty and values are added into the tree one at a time as the given order, i.e., insert 17, insert 15, and so on. Keep in mind that all tree nodes must satisfy the properties after every insertion.