# Task: qb_gcd (easy) — Greatest Common Divisor Implement **Greatest Common Divisor** as a function named `gcd` in a Marqdo `.mq.md` program (Euclidean algorithm). ## Requirements 1. Function name `gcd`, taking two integer parameters and returning their greatest common divisor (non-negative; `gcd(0, 5)` is `5`). 2. In `# main`, hardcode the demo calls below and print each result on its own line — exactly four lines, no labels. ## Demo calls (hardcode) - `gcd(48, 18)` - `gcd(1071, 462)` - `gcd(0, 5)` - `gcd(17, 5)` ## Expected output (self-check) Four lines: ``` 6 21 5 1 ``` ## Deliverable Write the program as a Marqdo `.mq.md` file. Return the complete source in a single ```markdown fence — no prose outside the fence.