Can You Place N Objects?

You are given a binary array `slots` representing a row of locations. `1` means the location is already occupied, and `0` means it is empty. You want to place `n` new objects into the row. A new object can be placed at index `i` only if: - `slots[i] == 0` - the left neighbor is either out of bounds or equal to `0` - the right neighbor is either out of bounds or equal to `0` Determine whether it is possible to place at least `n` new objects without moving any existing ones. Example: - For `slots = [1, 0, 0, 0, 0, 1]`, the maximum number of new objects that can be placed is `1`. - Therefore, the answer is `true` when `n = 1`, and `false` when `n = 2`. Return a boolean value.