Which is true for a standard Turing Machine $($TM$)?$There may be multiple accept states.The capacity of the tape is finite.There may be multiple reject states.The tape head can go only from left to right.The accept and reject states take effect immediately.