**Problem Statement:**
Given the required input arguments, write an efficient algorithm to solve the **Minimum Number of Arrows to Burst Balloons** problem. Implement the required logic as specified by standard definitions for this classic algorithmic challenge.
**Hint / Expected Approach:**
Sort by end; arrow at end of first balloon
**Edge Cases to Consider:**
- (1) Non-overlapping (n arrows)
- (2) All overlap (1 arrow)
- (3) Single balloon