Develop an algorithm for determining from a given board who won (Player X, Player Y, or no one). Remember that if a player gets three in a row horizontally, vertically, or diagonally they win. Assume that players are taking turns and it is impossible for both players to win. A brute force solution would use either a long series of if / else conditional statements or a couple of giant conditional statements. This would work but would result in a lot of (error-prone) code and would not be elegant (or get a very good grade). Better to make use of conditionals (if/else) and loop statements. (Hint: if you add up three elements in either a Copyright Notice: Columbus State Community College and its employees hold the copyright for this course material. This material is made available to students for their personal use only and may not be distributed for commercial purposes without the College's express written consent. Uploading this copyrighted material to "tutoring" or other non-Columbus State web sites is prohibited and may result in referral to the Office of Student Conduct and disciplinary action up to and including dismissal. row, column, or diagonal - what is the maximum possible