Please assist me with these questions.(for the 1st part just complete the bolded area. All other areas have been completed. Then complete the 2nd part 1. Devise an algorithm to receive a positive number, n, and output all prime numbers that are smaller than n and have the digit 5. For example, if n is 100, the program should output 5, 53 and 59. Your solution should have a main algorithm and two sub-algorithms, let's call them prime(num) and has5(num). Trace your algorithm and sub-sub-algorithm for the input 15. You should provide pre- and post-conditions for all your 3 (sub)algorithms. Now, let's trace this algorithm for the input n = 15: For i = 2 to 14, we check if i is prime and if i contains the digit 5. The prime numbers less than 15 are 2, 3, 5, 7, 11, 13. Among these, only 5 contains the digit 5. So, the output for n = 15 is [5]. 2. I also need help with creating JavaScript code for the flowchart provided below. Note: You will have to implement several functions that require multiple inputs (e.g., 12, 2, -3, 6, -11, -3, 1, -1). In these cases, accept as input a comma-delimited string (i.e., "12,2,-3,6,-11,-3,1,-1"). Then, break the comma-delimited string into a series of integers for processing with your algorithm. Thank you
Control structures
Control structures are block of statements that analyze the value of variables and determine the flow of execution based on those values. When a program is running, the CPU executes the code line by line. After sometime, the program reaches the point where it has to make a decision on whether it has to go to another part of the code or repeat execution of certain part of the code. These results affect the flow of the program's code and these are called control structures.
Switch Statement
The switch statement is a key feature that is used by the programmers a lot in the world of programming and coding, as well as in information technology in general. The switch statement is a selection control mechanism that allows the variable value to change the order of the individual statements in the software execution via search.
Please assist me with these questions.(for the 1st part just complete the bolded area. All other areas have been completed. Then complete the 2nd part
1. Devise an
Now, let's trace this algorithm for the input n = 15:
- For i = 2 to 14, we check if i is prime and if i contains the digit 5.
- The prime numbers less than 15 are 2, 3, 5, 7, 11, 13.
- Among these, only 5 contains the digit 5.
- So, the output for n = 15 is [5].
2. I also need help with creating JavaScript code for the flowchart provided below.
Note: You will have to implement several functions that require multiple inputs (e.g., 12, 2, -3, 6, -11, -3, 1, -1). In these cases, accept as input a comma-delimited string (i.e., "12,2,-3,6,-11,-3,1,-1"). Then, break the comma-delimited string into a series of integers for processing with your algorithm.
Thank you
Step by step
Solved in 2 steps
