6. To analyze the time complexity of the "brute-force" al gorithm in the programming part of this assignment, we (a) plain the nbr of all poibk: rontc; in iers (b) Consider a computer that can process 1 billion would like to count the number of all possible routes of n (number of locations). routes per second and n is 100, explain the ber of years needed to process all possible routes. (c) If we don't want the computer to spend more than 1 minute, explain the largest n the computer can process