Continuous Time Markov Chains

Ex:Consider a transfer line composed of two machines M$1$ and M$2$ with an intermadiate buffer in between as shown in the figure below. The workpieces first enter M$1,$ which can process $100$ items per hour $($assume there is an infinite amount of workpieces available in front of M$1).$ They are then sent to M$2,$ which can process $110$ items per hour. If $M2$ is busy, the workpieces are stored in the buffer. There is room for only one workpiece in the buffer.