Click and drag the given steps (in the right) to their corresponding step names (in the left) to prove that if a|b and b|c, then a|c. Step1 Step 2 Step 3 Suppose alb and b|c. By definition of divisibility, a|b means that a = bt for some integer t, and b|c means that b = cs for some integer s. We substitute the equation b = at into c = bs and get c = ats. By definition of divisibility, a = c(st), with ts being an integer, implies a|c. By definition of divisibility, c = a(ts), with ts being an integer, implies a|c. Suppose a|b and b|c. By definition of divisibility, a|b means that b = at for some integer t, and b|c means that c = bs for some integers. We substitute the equation b = cs into a = bt and get a = cst