Let p ≤ 1 be the fraction of machines in a network that are bigendian; the remaining 1 − p fraction are little-endian. Suppose we choose two machines at random and send an int from one to the other. Give the average number of byte-order conversions needed for both big-endian network byte order and receiver-makes-right for p = 0.1, p = 0.5, and p = 0.9. The probability that both endpoints are big-endian is p²; the probability that the two endpoints use different byte orders is 2p(1 − p).