Consider the following task graph. Each vertex is a function that you cannot modify. The number in each circle is the amount of time needed for that function to complete. The arrows in the graph indicate dependencies, i.e., A-> B indicates that function B cannot start until function A is complete. Given this task graph, what is the minimum amount of time needed to execute these functions in parallel? (The answer to this question is called the minimum makespan in the literature). 15 45 9 B E H 4 20 75 25 10 F A 30 60 12 G J D 104 175 152 0394