<s>[INST] The town of Rockingham consists of 100 streets, and it's said that every pair of streets intersects at most once. Prove or disprove that we can draw all 100 streets on a plane so that every pair of streets intersects at most once.[/INST]