Implement a simple B+ tree in Python with the following functionalities: 1. Ins

Implement a simple B+ tree in Python with the following functionalities:
1. Ins

Implement a simple B+ tree in Python with the following functionalities:
1. Insertion of keys into the tree.
2. Search operation to check if a key exists in the tree.
3. Print the keys of the tree in sorted order.
Include appropriate methods for splitting nodes and handling the insertion process in a non-full node. Test your implementation with a set of keys and demonstrate the tree’s behavior after each insertion.