1. Here is a B+ tree. Explain how the search algorithm would locate the data block for the value 45, starting at the top level node. For each node, the program will complete this sentence: At the node containing these search values: follow the_th pointer because 15 56 112 15 33 So Cole 14 33 45 50 51 52 68 70