Task 2: GCD Calculator for Two 8-Bit Integers

Create a sequential circuit to compute the GCD of two 8-bit integers, A and B, using the Euclidean algorithm.

Specifications:

1. Inputs: Two 8-bit integers (A and B).
2. Algorithm:
   • If A > B, update A to A - B.
   • If B > A, update B to B - A.
   • Repeat until A equals B, which is the GCD.
3. FSM Design: Describe the finite state machine (FSM) controlling each step (comparison, subtraction, loop).