Before we dive into the problem, I must say there are some interesting problem solving aspects that arise from trying to solve this problem. Especially if, like me, you try to generalize every problem you solve, then one quickly descends into some moderately tricky inductive proofs. But alas, none of this is relevant to solving this problem, so I'll leave it at that.
You already solved the first part of the exercise on your own. Nice job, by the way :-D. I've also implemented the graphs you drew in a graphing environment called Desmos; the URL to that is
https://www.desmos.com/calculator/abaonibhgh. It includes notes on how to solve this problem, albeit that they are quite terse; I wrote it more elaborately at first, but I lost the results due to refreshing when I had no internet connection.
Now to the open part of this problem. To solve it, I have again implemented the exercise in that same graphing environment, this time with more elaborate notes on how to solve the problem. The link to that is
https://www.desmos.com/calculator/gfxb4pkm3j. I've also purposefully left some parts open to the reader. In summary, you should look for triplets of intersection points that are
collinear with one another, which simply means the points all lie on the same line. Note that I give no guarantee that this always leads to the right results; I merely argue it
might. And the way I did it, it
does.
The key take-away here is that finding lines based on certain points that meet certain conditions is done by analyzing the
collinearity between certain sets of points. How exactly one should do that is, of course, dependent on the problem.
If you are still stuck or have proceeded to solve the exercise, please let us know.
Good luck!