Step 1: Idea:
We find the first step and the last step, then check the middle.
Step 2: Find the first step.
Packets must be made before anything else happens. So (C) is first.
Step 3: Find the last step.
The user sees the message only after it is complete. So (A) is last.
Step 4: Order the middle steps.
Packets travel first, (D), and are then put together, (B). The full order is C, D, B, A, which is only in option 4.
Step 5: Test every option against the result.
Option 1: It puts display first, which is impossible, so it fails.
Option 2: It also puts display first, so it fails.
Option 3: It puts reassembly first, when no packets exist yet, so it fails.
Option 4: It follows break, send, rebuild, show, so it fits.
Step 6: Conclusion.
Option 4 is correct.
\[ \boxed{(C),(D),(B),(A)} \]