Suppose we compute the answer to (a) using the path-counting algorithm from the lecture notes on paths in DAGs, representing the numbers of paths in this algorithm using unsigned long integers (64 bits). What is the largest n for which this algorithm will count the paths in GS correctly, without an integer overflow
