Need help to proof that NP⊆NP4


NP4 = { L | There exists a non deterministic polynomial Turing machine M, such that for every x∈L, M accepts x on at least 4 paths in the computational tree of M on x. and for every x∉L,M accepts x on at most 3 paths in the computational tree of M on x. }