Modify the provided PrintQs.java program. The program currently asks the user to enter an integer (call it the number N). Modify the program so that it will draw an NxN grid of Q's. For example, if you enter 7, the program will print to the screen QQQQQQQ QQQQQQQ QQQQQQQ QQQQQQQ QQQQQQQ QQQQQQQ QQQQQQQ There are 7 lines printed and each line has 7 Q's printed (without spaces). Use nested for loops and only print a single Q at a time. This example will call System.out.print('Q') 49 times and System.out.print() 7 times. Running the program with the value 2 will print QQ QQ

Write a java program called Fibonacci.java that prints the first n numbers of the Fibonacci sequence (starting with 0), where n is an integer entered by the user. Use a for loop. Some of the program has been provided below. More info about Fibonacci can be found here:https://www.mathsisfun.com/numbers/fibonacci-sequence.htmlhttps://www.youtube.com/watch?v=wTlw7fNcO-0 import java.util.Scanner;public class Fibonacci {    public static void main(String[] args) {        Scanner in = new Scanner(System.in); // Setting up scanner        System.out.print("Enter an integer: ");        int num = in.nextInt();        in.close(); // Close scanner when done using it        long current = 1;        long previous = 0;                // Add for loop logic here    }}

For JAVA.

Write a program that reads a set of integers from user and then prints the sum of even and odd integers

Given an array below, write a Java program to take input an integer n from the user and print the "True" or "False" depending upon the number n is present twice in the array or not. int [Jarr = {12,-67,13, 15, 12, 15, -67, 0, 1,1}

Write a program that reads a list of words. Then, the program outputs those words and their frequencies. The input begins with an integer indicating the number of words that follow. Assume that the list will always contain fewer than 20 words. Ex: If the input is: 5 hey hi Mark hi mark the output is: hey 1 hi 2 Mark 1 hi 2 mark 1 Hint: Use two arrays, one array for the strings and one array for the frequencies. 453086.3222312.qx3zqy7 LAB ACTIVITY HN356 10.16.1: LAB: Word frequencies 1 import java.util.Scanner; 3 public class LabProgram { 2 public static void main(String[] args) { Type your code here. */ LabProgram.java 0/10 Load default template...

Using python, please explain 1: A positive integer greater than 1 is said to be prime if it has no divisors other than 1 and itself. A positive integer greater than 1 is composite if it is not prime. Write a program that asks the user to enter an integer greater than 1, then displays all of the prime numbers that are less than or equal to the number entered  The program should work as follows: Once the user has entered a number, the program should populate a list with all of the integers from 2 up through the value entered. The program should then use a loop to step through the list. The loop should pass each element to a function that displays the element whether it is a prime number.

A program in java

In Java:  Forms often allow a user to enter an integer. Write a program that takes in a string representing an integer as input, and outputs yes if every character is a digit 0-9. Ex: If the input is: 1995 the output is: yes Ex: If the input is: 42,000 or 1995! the output is: no Hint: Use a loop and the Character.isDigit() function.

In PYTHON, write a code that allows the user to input two non-negative number sequences in increasing order (the numbers entered are always getting bigger, and no number repeats), both terminated by a -1. The size of each sequence can vary. The output of this code should be a third sequence that is a combination of both sequences 1 and 2 and is sorted in non-decreasing order.  Note: Non-decreasing order means there can be a repeated number in the third sequence (see example 1). A strictly increasing order sequence cannot have repeat numbers at all (see example 3). PLEASE do this using PYTHON, ONLY using while loops. NO language of "break", "len" or "True" please. Hint: we can use three separate lists to solve this code.