Represent and solve a small bipartite matching problem
Each tutor is considered for the listed groups. The relation gives the permitted pairs
A 1 means that the tutor in that row may be paired with the group in that column. A 0 means that pair is not allowed
| Tutor / Group | Group Red | Group Green | Group White |
|---|---|---|---|
| Tutor A | 0 | 0 | 1 |
| Tutor C | 1 | 1 | 0 |
| Tutor D | 0 | 1 | 0 |
All relation entries and counts are exact integers; no rounding is used