Using the optimal greedy algorithm described in class, solve the following instance of INTERVALSCHEDULING. Show enough work to convince me that you are using the algorithm and that your answer isn't just a guess or arrived at via brute force.$\{(4,6),(15,19),(22,24),(12,17),(1,5),(19,23),(6,10),(13,16),(7,9),(27,30),(25,29),(2,10)\}|$