I need to insert these numbers from left to right into a B-Tree where $ t=2$

Am I right? I am not sure as $ t=2$ means you can hold at most 3 keys per node, and here I have only 2. I used this site: https://www.cs.usfca.edu/~galles/visualization/BTree.html

MaxDegree = 3

When I look at the presentations of my class I see that if $ t=2$ then the tree CAN hold 3 keys per node ($ \text{Max} = 2 \cdot t -1$ ), but in the visualization it always divides the nodes… thank you!