Given a boolean expression consisting of the symbols 0 (false), 1 (true), & (AND), I (OR), and / (XOR), and a desired boolean result value result, create a function that counts the number of ways the expression may be parenthesized such that it evaluates to result. The expression should be completely parenthesized (for example, (0) A(1)) but not excessively (for example, (((0)) / (1))). EXAMPLE \scount Eval("l/01011", false) yields 2 counts. "0&0&0&1All0", true) = 10

Finish the function below that takes in the length of the two parallel sides of a trapezoid a and b, which are separated by a distance h, and returns its area.   In [ ]: defarea_of_trapezoid(a,b,h):# YOUR CODE HEREraiseNotImplementedError()   In [ ]: """Check that area_of_triangle returns the correct output for several inputs""" assert abs(area_of_trapezoid(3,3, 5) - 15) <=.1 assert abs(area_of_trapezoid(3,4, 5) - 17.5)

Write a program that will:• Select a random number between 1 and 100.• Test if the number is prime• Call a function named isPrime(). Pass the number to be tested. isPrime() should test whetherthe number has any factors other than 1 and itself. isPrime() returns either True or False.• isPrime() should use a function isDivisible(x,y) to test if y divides evenly into x. That is,isDivisible() will identify whether y is a factor of x.• Print the result

Given a boolean expression consisting of the symbols 0 (false), 1 (true), & (AND), I (OR), and /\ (XOR), and a desired boolean result value result, implement a function to count the number of ways of parenthesizing the expression such that it evaluates to result. The expression should be fully parenthesized (e.g., ( 0) A( 1)) but not extraneously (e.g., ( ( ( 0)) /\ ( 1)) ). EXAMPLE countEval("l/\01011", false) -> 2 countEval("0&0&0&1All0", true)-> 10

A palindrome is a word, phrase, number, or other sequence of characters that reads the same forward and backward, disregarding spaces, punctuation, and capitalization. Write a function isPalindrome that takes in a string s and returns a boolean value indicating whether s is a palindrome. Example: Input: s = "racecar" Output: true Input: s = "Hello" Output: false Input: s = "A man, a plan, a canal, Panama" Output: true Input: s = "12321" Output: true Note: The input string may contain spaces, punctuation, and capitalization, but they should be disregarded while checking for palindromes. An empty string is considered a palindrome.