The following table refers to search items for a key in B-trees and B+ trees.
Successful search X1B-tree Unsuccessful searchX2Successful search X3B+-tree Unsuccessful searchX4
A successful search means that the key exists in the database and unsuccessful means that it is not present in the database. Each of the entries X1,X2,X3 and X4 can have a value of either Constant or Variable. Constant means that the search time is the same, independent of the specific key value, where variable means that it is dependent on the specific key value chosen for the search.
Give the correct values for the entries X1,X2,X3 and X4 (for example X1=Constant, X2=Constant ,X3=Constant,X4= Constant)