Show that solution 3 to the Too Much Milk problem is safe that it guarantees that at most one roommate buys milk.

Path A noteA 1; hile (noteB-) / vait foir // leave note A // vait for no note B // spin // if no milk M // buy milk if (milk-0) { milk++; noteA0; // remove note A Path B noteB-l; if (noteA-0) // leave note B // if no note A if (milk-0)// if no milk milkt+; // buy milk noteB0 // remove note B Path A noteA 1; hile (noteB-) / vait foir // leave note A // vait for no note B // spin // if no milk M // buy milk if (milk-0) { milk++; noteA0; // remove note A Path B noteB-l; if (noteA-0) // leave note B // if no note A if (milk-0)// if no milk milkt+; // buy milk noteB0 // remove note B