Consider a slotted-time system in which a user transmits data in slots independently with probability p, i.e., in each slot, a packet is transmitted with probability p, and with probability 1 - p no packet is transmitted.

Let X ? {0, 1, 2, ...} denote the time interval between consecutive packet transmissions such that X = 0 denotes transmissions in back-to-nack slots, X = 1 denotes 1 idle slot between two transmissions, etc. Show that the user's traffic pattern (X) is memoryless