TM binary to unary conversion: Write a Turing machine that converts its input from binary to unary. In other words, if the input is the string x € {$,0,1}*, a $ followed by the binary expansion of the nonnegative integer n (for example, $101 to represent n = 5), then the machine outputs the string 1ª (e.g., 15 = 11111). You may assume the input string will be in this format, i.e., a $ followed by either just a 0, or followed by a binary string beginning with 1. Format the Turing machine

Write a Java program that uses two nested for loops and the modulus operator (%) to detect and print all prime numbers from 1 to 10,000. Prime numbers are integral numbers that are only evenly divisible by themselves and one (1). Display all the prime numbers found.