Example B Tree Based On The Search For 15 We Know It Is Not In The D 2 Tree How

In the picture example,

Example B + Tree` Based on the search for15*, we know it is not in the( d = 2 )tree !How about 17* ?)[ Search begins at root , and key comparisonsdirect it to a leaf ( as in [SAM )*[ Search for 5*, 15*, all data entries > = 24 * ..Root131724303 *5 *7 ** 614* 116*19* | 20* | 22*24* | 27* | 29*3:3*| 34* |38*|39 *What is 1/0 cost of these searches ?"