1. Assume the jamming-channel access game from wireless communication attacker-defender perspective. Assume there are two channels. Attacker has one radio transmitter to access one of the two channels and to create a jamming signal. Defender also has one radio transmitter to transmit on one of the two channels and to transmit an actual wireless signal. Assume this is a two-stage dynamic game (i.e., attacker and defender play this game two times) and the attacker and the defender have to choose a channel at the beginning of each game stage. Attacker and defender do not know each other’s moves at the current stage, but they gain history information about previous stages.

In any stage, if the attacker and defender choose the same channel, the attacker wins (as the channel is jammed) and defender loses. In that case, attacker’s payoff is 5 while defender’s payoff is -1.

In any stage, if the attacker and defender choose different channels, the defender wins (as the defender successfully transmits without being jammed) and the attacker loses (as jamming effort is not successful). In that case, attacker’s payoff is -1 while defender’s payoff is 5.

Demonstrate the above two-stage game in dynamic game manner using extensive form representation. Show your Kuhn tree information clearly.