Resource Booking System

Imagine you are tasked with creating a booking system for a single shared resource (e.g., a meeting room) that allows users to reserve time intervals without overlaps.

Your goal is to implement a class with a method that supports the following operation:

• book(startTime, endTime): Attempts to book the resource for the given time interval [startTime, endTime). If the resource is available for the entire requested time span (i.e., the new booking does not overlap with any existing bookings), the booking should be accepted and the function should return true; otherwise, it should return false, and the booking should not be added.

Consider the following constraints:

1. Time intervals are represented as integers. A booking interval [startTime, endTime) includes startTime and excludes endTime.
2. Bookings must not overlap. Two intervals [s1, e1) and [s2, e2) are non-overlapping if and only if e1 <= s2 or e2 <= s1.
3. Optimize your implementation so that both booking and checking for overlaps operate efficiently, even as the number of bookings grows.

Your implementation should include:

• A constructor (or initialization method) for setting up the booking system.
• The book(startTime, endTime) method described above.

Write a complete solution in a programming language of your choice. Ensure your code is well-documented and includes a few test cases to demonstrate its functionality.