[mixingl: suppose bitcoin was changed such that transactions can have at most two inputs and two outputs (this is the case in zerocash, for example). alice, bob, and carol each have a single utxo worth 1 btc. they want to mix their coins among the three of them (without a trusted server) so that three output utxos are worth 1 btc each and they are perfectly shuffled: all six (3! ) permutations are equally likely. they decide to do the following: alice and bob 3. post a transaction with their two bitcoins as input and two fresh addresses, x and y, as outputs, each holding 1 btc. alice controls one address and bob controls the other, but an observer cannot tell which is which. suppose x is listed as the first output in this transaction. next, carol and the owner of x post a similar transaction: carol's coin and the coin x are the inputs, and two fresh addresses w and z are the outputs, each holding 1 btc. carol controls one address and the owner of x controls the other. as before, an observer cannot tell which is which. they use y, z,w as the final shuffled coins. pictorially, the mixing process looks as follows: 3 what are the anonymity sets for the addresses y, z, and w? assuming that each mix independently assigns equal probability to both outcomes, what is the probability that alice contr what is the probability that carol controls w? a. b.