Consider the meet$-$in$-$the$-$middle attack on $2$DES. How many candidate $($K$1,$ K$2)$ pairs would be expected after testing a single $($plaintext$,$ ciphertext$)$ pair?

Out of those, how many pairs would be eliminated with a second $($plaintext$,$ ciphertext$)$ pair?