Suppose that all search key values are integers, and that a leaf page can contain four data entries. Give examples of each of the following: A B+ tree whose number of levels changes from 2 to 3 when the value 22 is inserted. Show your structure before and after the insertion.
A B+ tree in which the deletion of the value 22 leads to a redistribution. Show your structure before and after the deletion.
A B+ tree in which the deletion of the value 22 causes a merge of two nodes but without altering the height of the tree. Show your structure before and after the deletion.

Acommon algorithm for converting a decimal number to binary is to repeatedly divide the decimal number by 2 and save the remainder. this division is continued until the result is zero. then, each of the remainders that have been saved are used to construct the binary number.write a recursive java method that implements this algorithm.it will accept a value of int and return a string with the appropriate binary character representation of the decimal number.my code: public class lab16{public string converttobinary(int input){int a; if(input > 0){a = input % 2; return (converttobinary(input / 2) + "" +a); } return ""; } }