We can assign a value to each character in a word based on their position in the alphabet (a = 1, b = 2, : 1, b = 2, ..., z = 26). A balanced word is one where the sum of the values on the left side of the word equals the sum of the values on the right side. For odd-length words, the middle character (balance point) is ignored. Write a function that returns true if the word is balanced and false if it is not. Examples balance("zips") → true // "zips" = "zilps" = 26+9 16+19 = 35 35 = true balanced ("brake") → false // "brake" = "br|ke" = 2+18 | 11+5 = 20 16 = false

3. Find Relatively Prime Write a function to return a number that is relatively prime with the given number. /* return an integer that is relatively prime with n, and greater than 1i.e., the gcd of the returned int and n is 1 Note: Although gcd(n,n-1)=1, we don't want to return n-1*/int RelativelyPrime (int n)   4. Find Inverse Then implement the following function, which returns the inverse modulo, and test it.Note that you need to check whether a and n are relative prime before calling thisfunction. Recall that a and n are relatively prime means that gcd(a,n)=1, i.e., theirgreatest common divisor is 1. Also recall that the extended Euclidean Algorithm canfind the integer s and t for a and n such that as+nt=gcd(a,n), where s is the inverseof a modulo n. /* n>1, a is nonnegative *//* a<=n *//* a and n are relative prime to each other *//* return s such that a*s mod n is 1 */int inverse (int a, int n){int s, t;int d = ExtednedEuclidAlgGCD (n, a, s, t);if (d==1){return (mod (t,…

Write a function that takes two integers and returns True if the integers have a common divisor that is different than 1, otherwise returns False. For example, notRelPrime(3,5) returns False, whereas notRelPrime(8,12) returnsTrue. Because, 3 and 5 have only one common divisor, which is 1, whereas 8 and 12 are both divisible by 1, 2 and 4.

Write a function that takes an integer input and check whether it can be expressed as the sum of two prime numbers. If it can be expressed as sum of two prime numbers then print those numbers. You also need to account for multiple combinations of prime number. Take a range as input from use and print all such number in that range. You can use as many helper function as needed. Sample: Enter range: 2 10 Range 2 to 10: 4: Can be written as 2 +2 5: Can be written as 3+ 2 6: Can be written as 3 +3 7: Can be written as 2 + 5 8: Can be written as 3 +5 9: Can be written as 2 + 7 10: Can be written as 3 + 7 10: Can be written as 5 + 5

Write a function called freezing that takes a vector of numbers that correspond to daily low temperatures in temperatures (that is, lower than 32 F) without using loops. Here is an example run: numfreeze = freezing([45 21 32 31 51 12]) %3D numfreeze = 3 %3D

A prime number is a number that is only evenly divisible by itself and 1.  For example, the number 5 is prime because it can only be evenly divided by 1 and 5.  The number 6, however, is not prime because it can be divided evenly by 1, 2, 3, and 6.   Design a Boolean function called isPrime, that accepts an integer as an argument and returns True if the argument is a prime number, or False otherwise.  Use the function in a program that prompts the user to enter a number and then displays a message indicating whether the number is prime.  The following modules should be written: getNumber, that accepts a Ref to an integer, prompts the user to enter a number, and accepts that input isPrime, that accepts an integer as an argument and returns True if the argument is a prime number, or False otherwise showPrime, that accepts an integer as an argument , calls isPrime, and displays a message indicating whether the number is prime The main module, that will call getNumber and showPrime

python programming Write a function find_hypot which, given the length of two sides of a right-angledtriangle, returns the length of the hypotenuse. (Hint: x ** 0.5 will return the squareroot.)

in c programing Write a program that takes in a positive integer as input, and outputs a string of 1's and 0's representing the integer in binary. For an integer x, the algorithm is: As long as x is greater than 0 Output x % 2 (remainder is either 0 or 1) x = x / 2 Note: The above algorithm outputs the 0's and 1's in reverse order. You will need to write a second function to reverse the string. Ex: If the input is: 6 the output is: 110 The program must define and call the following two functions. Define a function named IntToReverseBinary that takes an int named integerValue as the first parameter and assigns the second parameter, binaryValue, with a string of 1's and 0's representing the integerValue in binary (in reverse order). Define a function named StringReverse that takes an input string as the first parameter and assigns the second parameter, reversedString, with the reverse of inputString. void IntToReverseBinary(int integerValue, char binaryValue[])void StringReverse(char…

You shouldn't date someone whose age is less than half your own age plus 7. Write a boolean-valued function can_date(age1, age2) that takes the ages of two people and return True if they can date. The ages are not in any particular order - the bigger one may be either first or last.

We can assign a value to each character in a word, based on their position in the alphabet (a = 1, b = 2, ..., z = 26). A balanced word is one where the sum of values on the left-hand side of the word equals the sum of values on the right-hand side. For odd length words, the middle character (balance point) is ignored. Write a function that returns true if the word is balanced, and false if it's not. Examples balanced ("zips") → true // "zips" = "zi|ps" = 26+9|16+19 = 35|35 = true balanced ("brake") // "brake" = "br|ke" false = 2+18 | 11+5 = 20 16 = false