## 1. Count Valid Endpoint Combinations You are given - `S`: total number of servers - `C`: total number of clients - You need to **select exactly `K` endpoints** such that - At least `minS` of them are servers - At least 10 of them are clients. You are to compute how many valid combinations of endpoints you can select from the given servers and clients that satisfy all constraints. ### ✅Constraints: - `0 ≤ min S ≤ S ≤ 1000` - `0 ≤ min C ≤ C ≤ 1000` - `0 ≤ K ≤ S + C` - Use combinatorics to calculate combinations efficiently. - **Return the result modulo `10^9 + 7`**, as it can be very large. Input: S = 3, C = 1, minS = 1, minC = 0, K = 2 Output: 6 Input: S = 2, C = 3, minS = 1, minC = 1, K = 2 Output: 6 Input: S = 1, C = 3, minS = 2, minC = 1, K = 3 Output: 0 # 2. **Grey Level of Satellite Imagery** You are given a 2D grid of binary strings where each character is either `'0'` or `'1'`. This grid represents a black-and-white satellite image. Your task is to compute the **grey level value** of each cell based on the following rule: For each cell `(i, j)`in the grid: - Count the number of `'1'`s in **row `i`** and **column `j`.** - Count the number of `'0'`s in **row `i`** and **column `j`.** - The transformed value at `(i, j)` is ```markdown grey_level[i][j] = (ones_in_row[i] + ones_in_col[j]) - (zeros_in_row[i] + zeros_in_col[j]) ``` Return the **maximum value** among all the computed grey levels. Also, for debugging purposes, output the transformed grid.
