C Starting from the Office Depot headquarter in Wichita (Depot node 0), you are expected to determine a route for a salesman visiting all four clients (nodes 1, 2, 3, and 4) in four different cities once and returning to the headquarter. Distance between the two nodes is displayed below. Distance 0 (Headquarter) 1 2 3 4 0 N/A (Headquarter) 1 10 10 12 11 10 N/A 9 7 8 2 10 9 N/A 13 12 3 12 7 13 N/A 10 4 11 8 12 10 N/A Apply the Brute Force approach to analyze the problem. Numeric answers are only accepted. (a) How many routes should be considered? Blank 1 (b) What is the route for the salesman? (Hint: If the salesman visits 0 1 2 3 -> 4-> 0, then you should answer 012340). Blank 2

What happens if you try to decrease the scale or precision of a NUMBER column to a value less than the data already stored in the field?