Let O be a fixed point in the plane. We have 2024 red points, 2024 yellow points and 2024 green points in the plane, where there isn't any three colinear points and all points are distinct from O. It is known that for any two colors, the convex hull of the points that are from any of those two colors contains O (it maybe contain it in it's interior or in a side of it). We say that a red point, a yellow point and a green point make a bolivian triangle if said triangle contains O in its interior or in one of its sides. Determine the greatest positive integer k such that, no matter how such points are located, there is always at least k bolivian triangles. combinatoricscombinatorial geometry