2. (standard) In class, we have shown that the emptiness problem is unde- cidable for LBAs. A LBA is simply a TM that never moves out of the first |3| (the input portion) cells for any input word r. Now, I define a restricted form of LBA, called jump-LBA. A jump-LBA M is a LBA such that, once it writes on a cell, it must jump back to the beginning of the tape. Show that the emptiness problem for jump-LBAs is undecidable