What is the result of XOR$$ing every n$-$bit string? For example, below is the expression for

the XOR of every $3-$bit string:

$000001010011100101110111$

Note that this question is asking about the result of evaluating this expression for general n$.$

$2.(10$ pts$)$ When using the one$-$time pad with the key k $=0$n$,$ encryption results in Enc$($k$,$ m$)=$ k$$