$($a$)$ check if the node has a right sibling and whether it can "lend" a key to the right sibling. If so$,$ it should implement that and remember to update the pointers. The function $`$fix$\_$pointers$\_$for$\_$children$`$ will be very useful. $-($b$)$ check if the node has a left sibling and whether it can "lend" a key to the right sibling. If so$,$ it should implement that and remember to update the pointers. The function $`$fix$\_$pointers$\_$for$\_$children$`$ will be very useful. $-($c$)$ Otherwise, we revert back to the old code for splitting a node that is given to you.