KöMaL 2022 B5261

Starting Player and Second Player are playing a game on the edges of a complete graph of 100 vertices. They take turns in colouring an edge of the graph that has not been coloured before. In each step, Starting Player colours his edge red, and Second Player colours his edge blue. The game terminates and Starting Player wins if there is a set of four vertices such that all the six connecting edges are red. The game terminates and Second Player wins if there is a set of four vertices such that all the six connecting edges are blue. The game terminates with a draw if there is no such set of four vertices but there remain no further vertices to colour. Who has a winning strategy?