Construct a Turing machine that accepts the language of strings of the form an, where n is a composite number. A composite number is any integer n that can be written as a product n = p ·q, where p and q are integers with 1 < p, q < n. Specifically for the purpose of this question, 0 and 1 are not considered composite numbers. Your machine can be non-deterministic, and it can use multiple tapes (as many as you need). I suggest breaking up the construction into smaller sub-tasks. In particular, the machine you built in Question 3 might be useful. For this question, it is enough to give a detailed description of the algorithm of your machine. You do not need to draw a full transition diagram. Although you can draw diagrams for smaller parts if it helps you illustrate your construction

Create an efficient java code to solve the problem by using dynamic programming

We are going to write a Turing machine that reads a string of 1's as input and produces a 1 for output if the string is a length that is a multiple of 3 and outputs a O otherwise. The 1 or O should be spaced 1 position to the right of the end of the input. You may assume that the input contains only zero or more 1's. For example here are four before and after snapshots. Before After B1 В Input is zero 1's (0 is a multiple of 3) <== 1 1 0 11 11 0 111 111 1 Here is a Turing machine that does most of the work but is missing one instruction. Fill the blank with the instruction needed. Follow the format of the other instructions (ie, current-state current- head head-instruction new-state, with exactly one space between each). qO 1 R q1 q1 1 R q2 q2 1 R q0 q0 BR q3 q1 BR q4 93 В 1 q5 q4 B0 q6 Hint: I suggest you draw what is given and then figure out what single instruction will make the machine behave as described.

Write C++ program to show that the sum of the infinite series, which is converges to ln 2. ??= � 1(2??+ 1)(2??+ 2)????=0Compute the answer for N=50 and N=100