how will the tree look after all the given keys are inserted

Consider the following b+-tree where leaf nodes can hold at most 5 keys and internal nodes can hold at most 4 keys. Not shown below is the fact that each key in a leaf is accompanied by a pointer to a record stored elsewhere. Consider that 6 records are inserted into the file. The keys of the records to be inserted are: 65,75,85,150,1,2