All the answers given here are not entirely true. The question given is not solvable because "the probability of india winning " is not given in the question.
Let e1 : India wins ; e2 : Akbar says that "Amar told me that India won"
now in the Numerator(e1 "AND " e2) there will be two cases :
case (i) :- India actually winning and both amar and akbar telling the truth (i.e. IndiaWin AND AmarTruth AND AkbarTruth)
case (ii) :- India actually winning and both amar and akbar telling lies. (i.e. IndiaWin AND AmarFalse AND AkbarFalse)
Denominator will be the reduced sample space of event e2 i.e. ("Akbar telling anthony that ''Amar told him that india won'").
Here we need to consider the cases where india winning and also india losing which will give us 4 cases :
case (i) :- India actually winning and both amar and akbar telling the truth (i.e. IndiaWin AND AmarTruth AND AkbarTruth)
case (ii) :- India actually winning and both amar and akbar telling lies. (i.e. IndiaWin AND AmarFalse AND AkbarFalse)
case (iii) :- India actually losing and amar telling truth and akbar telling lie (i.e. IndiaLose AND AmarTruth AND AkbarFalse)
case (iv) :- India actually losing and amar telling lie and akbar telling truth (i.e. IndiaLose AND AmarFalse AND AkbarTruth)
Now writing all of them in equation, we get one which I have written in the image
But to find the solution, we need P(India winning) is not given, so no sufficient data to solve it.
Note :- Everyone are considering only the cases where india wins. But we need to consider the cases where the india loses also, since the sample space of event e2 contains both india winning and also india losing..
I am attaching also the tree diagram which may make it easier to understand.
Also we can't just assume that "arjun and amar telling lies are independent of the outcome of the match or not". So, in either way, this question is unsolvable. There's just no sufficient information for anthony to come to a conclusion.