Data Base management

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, complete this sentence: At the node containing these search values: , the program will follow the th pointer because ?3