Compute maximum PRF advantage Hello all, I'm new to crypto,  I'm not sure if my thought process is correct ? any assistance will be helpful. 

How useful is the partial info that A gets from (a), (b), and (c) ; in (c) A can determine Fn. How useful is this partial info in distinguishing F from a Rand Func

I understand that the advantage is the P ( Real) - P ( Rand). and in the first instance where the key is 000, each query that A makes returns the same output as the input. So the adversary will guess that they are in the real world since input and output matches 

So does that mean the advantage is: 1 - (2^-3) ??
So does that mean the advantage is: $1 - (2^{-3})$ ??


That would be the advantage if the attacker knew apriori that the key was 000; however in this model, the attacker knows that the key is one of the eight listed values, but doesn't know which one (and each of the eight possibilities are equiprobable).

So, if the attacker doesn't know what the key is, what strategy of inputs can the attacker use to get the optimal advantage?  Hint: if the attacker is restricted to a single query, what's the probability distribution of the output of the block cipher; how does that compare to the probability distribution of a truly random output?