Question sc8.4 (A2) Write an algorithm which will take as inputs a, b and c, all integers (not necessarily positive) and will find the minimal distance between them. That is, it will find which two are closest together, and will tell us how far apart they are. (So for a = −3, b = 1, and c = −5, it would return ‘2’ because a and c are 2 apart, and no pair of them are closer than that.)