write solutions on paper not computer, using C language

Write a function called int word Start Index (char str [], int out []) which, given a string, returns an array containing the index where each word starts. For example: str: "The Cat in the Hat" out: [0 4 8 11 15] The function also returns the total number of words (an integer). You can assume that the array starts with a letter (and not a space). Write a function called int make First Letter Caps (char str) which takes in a string and capitalizes the first letter of each word. The number of words capitalized is explicitly returned. Write a function of the form: int test For Prime (int n) which returns 1 if n is prime and 0 is n is not prime. Write a program to print out all the prime numbers less than 1000. Write the function: int down Sample Array (int n, int in [], int out []) which given an array (and its dimension) computes and stores another array which is half the size of the original. Discard every other component of the original array; for example, in: [9 8 4 0 2 4 2 6 3 7 6 3 7 5] out: [9 4 2 2 3 6 7] You can assume the dimension of in is even. The dimension of out is returned (explicitly). Write a function int up Sample Array (int n, int in [], int out []) which given an array (and its dimension) computes and stores another array where every element is duplicated. For example: in: [9 8 4 0 2] out: [9 9 8 8 4 4 0 0 2 2] The dimension of out is returned (explicitly). Write void bitwise AND (int n, int x [], int y [], int result []) which, given 2 arrays (containing 1's and 0's), returns the bitwise AND operation between two binary arrays. For example: in: [1 0 1 1 0 1 1 1 0 0 1] out: [1 0 0 0 1 1 0 0 1 0 1] result: [1 0 0 0 0 1 0 0 0 0 1] Write a function for bitwise OR, as well