Compaction: Merging SSTables

Write a C program that implements size-tiered compaction by merging two SSTables.

Requirements:

• Define two input arrays representing SSTables (sorted by key): SSTable A: (1,10), (3,30), (5,50), (7,70), (10,100) SSTable B: (2,20), (3,35), (6,60), (8,80), (10,110)
• Implement merge_sstables() that:
  • Merges both inputs in sorted order (like merge sort)
  • When the same key appears in both, keep the value from B (newer SSTable wins)
  • Removes tombstones (key=-1 means deleted; do not include in output)
• Print the input SSTables
• Print the merged SSTable
• Calculate and print:
  • Input total key-value pairs: 10
  • Output total key-value pairs (should be 8: 3 appears once, 10 uses B's value)
  • Write amplification: output pairs / input unique keys
  • Space reclaimed: input pairs - output pairs
• Simulate adding a tombstone: key=5 with value=-1 in SSTable B, show it is removed during compaction
• Include a note about why leveled compaction has better read amplification