Problem Statement:
Find the most likely winner of a tournament.

Given :

1. Number of Teams in a tournament, N.
2. Tournament Fixture
   e.g. binary tree like structure for the games in the tournament.
   if N = 3
   one possible tournament fixture could be
   1
   2 3
   this means there will be two games int the tournament i.e.
   Game 1 => (Team 2 vs Team 3)
   Game 2 => (Winner(Game 1) vs Team 1)
3. NxN Matrix containing values between [0,1].
   Here matrix[i][j] represents the probability of team 'i' winning against team 'j'

Output:
Most likely tournament Winner.