B-Tree Search

Write a C program that implements B-tree search.

Requirements:

• Use the B-tree node structure from the previous task (MAX_KEYS=3)
• Implement btree_search(node, key) that returns the value or -1 if not found
• Use linear search within each node (simpler than binary search for small MAX_KEYS)
• Build a B-tree manually with this structure: Root (internal): keys=[20, 50], children=[leafA, leafB, leafC] leafA: keys=[5, 10, 15], values=[50, 100, 150] leafB: keys=[25, 30, 40], values=[250, 300, 400] leafC: keys=[60, 70, 80], values=[600, 700, 800]
• Search for these keys and print results: 5, 20, 30, 50, 100
• For each search, print the path from root to leaf (which child was followed at each level)
• Implement btree_search_range(node, min_key, max_key) that prints all key-value pairs in range
• Test range search with min=15, max=60
• Calculate and print the number of nodes visited for each search