Algorithms, *.java

Problem 4. Given a collection of intervals (on the real line) and a real value x, a stabbing count query is the number of intervals that contain.Design a data structure that supports interval insertions intermired with stabbing count queries, in logarithmic time per operation. Problem 4. Given a collection of intervals (on the real line) and a real value x, a stabbing count query is the number of intervals that contain.Design a data structure that supports interval insertions intermired with stabbing count queries, in logarithmic time per operation