4.11 LAB: Number pattern Write a recursive function called print_num_pattern() to output the following number pattern. Given a positive integer as input (Ex: 12), subtract another positive integer (Ex: 3) continually until a negative value is reached, and then continually add the second integer until the first integer is again reached. For this lab, do not end output with a newline. Do not modify the given main program. Ex. If the input is:

Q:1 a) Can a predefined function be recursively called by the programmer? Elaborate. b) Write a program in C to take input for an integer.If the given integer is prime then display the product of its digits otherwise check whether it is even or odd.Use minimum three functions including main function.

Java A jiffy is the scientific name for 1/100th of a second

Can you please use python code and explain it please

6. Given the following main function: // remove the first digit of a number int main() { int n, m; cout >n; m-removeFirst(n); cout <

Chapter 8 Irvine book, When I compiled this code I get the following errors ;Greatest Common Divisor Comment !Write a recursive implementation of Euclid’s algorithm for finding the greatest common divisor (GCD) of two integers. Descriptions of this algorithm are available in algebra books and on the Web. Write a test program that calls your GCD procedure five times, using the following pairs of integers: (5,20), (24,18), (11,7), (432,226), (26,13). After each procedure call, display the GCD.! INCLUDE Irvine32.incCalcGcd PROTO,int1:DWORD, int2:DWORD .dataarray SDWORD 5,20,24,18,11,7,438,226,26,13str1 BYTE "Greatest common divisor is: ",0 .codemain PROC    mov  ecx,LENGTHOF array / 2    mov  esi,OFFSET array L1:    INVOKE CalcGcd,[esi],[esi+4]    mov  edx,OFFSET str1    call WriteString    call WriteDec    call Crlf    add  esi,TYPE array * 2    loop L1     exitmain ENDP ;---------------------------------------------CalcGcd PROC,    int1:DWORD, int2:DWORD;; Calculate the greatest common…

part 1) Write a generator expression G that produces the sequence of positive integers k in therange 1 < k < 100 such that k is not divisible by 7.   Part2) Write a Python function called not_divisible by (d, n) that takes as input two positiveintegers d and n, and returns a generator object producing th: sequence of positive integers k in therange 1 ≤ k < n such that k is not divisible by d

Could you make sure the code is correct. Please read the instructions carefully and the example runs. Thanks.

5. use c code to Write a stringSearch function that gets two strings one called needle and the other called haystack. It then searches in the Haystack for the needle. If it finds it, it returns the index of where the needle starts in the haystack. If the needle cannot be found, it should return -1 Prototype: int stringSearch(char needle[], char haystack) Example1: Haystack: “This is just an example” Needle: “just” Result: 8 Example2: Haystack: “This is just an example” Needle: “This” Result: 0 Example3: Haystack: “This is just an example” Needle: “this” Result: -1 Hint: all the answer need to include an output and use c code to answer

code in python (A) please   Solve the so-called "Birthday Problem". Write a program that takes an integer ?N and uses the function np.random.randint (low = 0, high = N) from numpy to generate a random sequence of integers between 00 and ?−1N−1. Run experiments to validate the hypothesis that the number of integers generated until the first repeated value is approximately ?∗?2⎯⎯⎯⎯⎯⎯⎯√π∗N2. a) Write a function birthday(N) that returns the number of values generated until a value is repeated as a function of the range of possible values ?N (from 00 to ?−1N−1); b) Write a function birthday_sim(N) that repeats birthday(N) a total of n_sim = 20000 times and returns the average of all the numbers generated; c) Show on one plot that as ?N increases (with a doubling experiment), from ?=2N=2 to ?=1000N=1000, the value of birthday_sim(N) approaches ?∗?2⎯⎯⎯⎯⎯⎯⎯√π∗N2.