Real quick and dirty implementation of union of intervals problem to give the count of disjointed intervals.
- Will take in 2 arrays of ints A and B and the number of elements in the list N.
- The pythonic solution uses built in python sort libraries and combining into tuples while the other solution will use a homebrewed sort solution.
- Return an integer with the count of the unique disjointed intervals.