How many steps (divisions) does the Euclidean Algorithm take to find GCD(103,56)\text{GCD}(103, 56)GCD(103,56)?
6
7
4
5