If I'm given a M-Way Search Tree, how would I determine it is a B-Tree with the parameter K < M, where K is the value that is to be inserted and M is the Order of the M-Way Search Tree. This is not something that I really need to code, but something to understand and then give a general summary on how to check for it, even general pseudo code would work. I know that an M-Way Search tree is also a B-Tree but not vice versa, so I just curious how they would tie in together with the specification of k < m before determining if the M-Way Tree is a B-Tree. Thank you for your time and help in advance.