While useful, the modulo operator in JavaScript is not infallible when negative numbers are thrown into the mix. For example, -13 % 64 = -13 when the actual answer is 51. Create a function to fix this. It should also work for positive numbers. Examples mod (-13, 64)→ 51 mod (50, 25) - 0

javascript Need help defining a function frequencyAnalysis that accepts a string of lower-case letters as a parameter. frequencyAnalysis should return an object containing the amount of times each letter appeared in the string. example  frequencyAnalysis('abca'); // => {a: 2, b: 1, c: 1}

1. a.Palindromes Complete the function palindrome(String text). Return true if text is a palindrome; if the word is identical forward and backward. Otherwise, return false. Example:  palindrome(“racecar”) == true palindrome(“kayaks”) == false See main() for more examples. You can use text.charAt(i) to find the character at index i of text. Use recursion. palindrome() should call itself. No loops allowed. b. Complete the function nestedBrackets(String s). This function should find properly nested brackets within s. Return true if brackets are opened and closed correctly, and false otherwise.  Single pairs and nested pairs are valid. For example: z[z]z, [zz[zz]z], [z[[z]zzz]], zzzzz Incorrect pairings and multiple separate pairs are not valid. For example: zz[zz, ]zzz[, [zzz][z], [z[z][z]z] See main() for more examples. nestedBrackets() should call firstIndexOf() and lastIndexOf() to help you solve the problem. Use recursion. nestedBrackets() should call itself. No loops…

Write a function tuplinator (number) that takes a number argument and returns a tuple consisting of the number, the number squared, and the number cubed. See below for examples. For example: Test Result print(tuplinator (2)) (2, 4, 8) print(tuplinator (3)) (3, 9, 27) Answer: (penalty regime: 0, 10, ... %) 1