Compute the time for complexity for the following algorithm X 7-9 For xin On Return For x inconi For y info Return (y Toon T-on) T-on) TO(1) Compute the time for complexity for the follwing function 73-1232313132n2134n0312321 T-On? Troina) Toni T-O(1) 5 Every multitape Turing machines has an equivelant single tape Turing machine Suppose we have multitape Turing machine as follows Tape 10.1.1.1.01 Tape 2.a.b.a) So, if we would like to transfer these two tapes into single-tape, the answer would be Single tape -(5.0,11,1,0,55,babal Single tape 0.1.1.1.0,baba Single_tape-(0.0.1.1.1.0...baba#) Single_tape Start0.1.1.1.0...ADA ACORDE 8 The time for computing double loops function is taken more time than a single loop. The problem is a subset of the NP problem. P