Using the decomposition from part (ii), Uθ−1maps Alice's ∣ψ1⟩ to ∣0⟩ and ∣ψ2⟩ to ∣1⟩. Alice obtains 0 or 1, each with probability 1/2. Conditional on outcome 0, Bob has ∣ψ1⟩; conditional on outcome 1, Bob has ∣ψ2⟩.
Alice performs the operation and measurement from part (iii) and sends the one-bit outcome to Bob. If the bit is 0, Bob does nothing. If it is 1, Bob applies ZX, which maps ∣ψ2⟩ to ∣ψ1⟩ by part (i). In either case Bob finishes with the known target state ∣ψ1⟩, using one shared Bell pair and one classical bit.