Give an implementation of the Matrix class used in this chapter. Make sure your split()method takes constant time.  Modify the pop Top()method of the linear iz able Bounded DE Queim-plementation so it...

Give an implementation of the Matrix class used in this chapter. Make sure your split()method takes constant time.

Modify the pop Top()method of the linear iz able Bounded DE Queim-plementation so it will return null only if there are no tasks in the queue. Note that you may need to make its implementation blocking.