Write Top down approach Algorithm in Unsupervised Learning Input: I = {I1, I2, … , In} Output: O

Please show all the transition functions steps

For alphabet {0, 1}, the behavior of a Turing machine M can be described as follows: 1. Scan the tape and mark the first O that has not been marked. If no unmarked 0 is found, go to stage 4. Otherwise, move the head back to the front of the tape. 2. Scan the tape and mark the first 1 that has not been marked. If no unmarked 1 is found, reject. 3. Move the head back to the front of the tape and go to stage 1. 4. Move the head back to the front of the tape. Scan the tape to see if any unmarked 1s remain. If none are found, accept; otherwise, reject. The correct statements are: L(M) = {w|w contains more Os than 1s} OL(M) = {w|w contains less Os than 1s} OL(M) = {w|w contains an equal number of Os and 1s}

find the time efficiency using 5 steps plan: Graph Complete(A[0..n-1,0..n-1]) Input:Adjacency matrix (A[0..n-1,0..n-1]) output: 1(true) if n=1 return 1 else if not Graphcomplete (A[0..n-2,0..n-2]) return 0 else for j <--- 0 to n-2 do if A[n-1,j] =0 return 0 return 1