Two engineers share a n$-$bit secret key. Engineer $1$ has a n$-$bit secret key K$1.$Engineer $2$ has an n$-$bit secret key K$2.$ They are not sure that each one of them has thecorrect secret key. They decide to communicate to determine whether the have the samesecret key. They use the following method:Engineer $1$ selects arbitrarily an n$-$bit value P$.$He uses his secret key to compute the value X: $1$ ; : X K P exclusive or He sends the value X over a communication channel to Engineer $2.$Engineer $2$ uses his secret key to compute the value Y: $2$ Y K X He then sends Y to engineer $1.$Engineer $1$ compares Y to P$.$ If Y$=$P he concludes he and engineer $2$ have the same secretkey$,$ i$.$e$.$ K$1=$K$2.$Assume an attacker eavesdrops on the communication channel. Explain whether theattacker can recover the secret key.