In Kotlin, Write the function divIntSafe(a: Int, b:Int).  This function should take two Ints, convert them to doubles, divide the first by the second, and return the result. Write code that creates a list of the inverses of the Ints from 1 to 10,  Use a lambda expression as the initializer expression. Then do it again with divIntSafe function as the initializer expression.

Could you solve this Question please? Write a function called has_duplicates that takes a string parameter and returns True if the string has any repeated characters. Otherwise, it should return False.   Implement has_duplicates by creating a histogram using the histogram function above. Do not use any of the implementations of has_duplicates that are given in your textbook. Instead, your implementation should use the counts in the histogram to decide if there are any duplicates.  Write a loop over the strings in the provided test_dups list. Print each string in the list and whether or not it has any duplicates based on the return value of has_duplicates for that string. For example, the output for "aaa" and "abc" would be the following.  aaa has duplicatesabc has no duplicates  Print a line like one of the above for each of the strings in test_dups.  Obs:Copy the code below into your program def histogram(s):     d = dict()     for c in s:          if c not in d:               d[c] =…

In Kotlin, Write the function divINtSafe with an a:int and b:int. The function should take two ints,convert to doubles, and then divide the first by the second. Retun the result.

Write a program called p3.py that contains a function called reveal_recursive() that takes a word (string) and the length of the word (int) as input and has the following functionality: 1. prints the word where all characters are replaced by underscores 2. continue to print the word revealing one character at a time. i.e., the second line printed should print the first character followed by “_”’s representing the rest of the word. (see example below) 3. the function should end after printing the entire word once. 4. This function should be recursive  Example: #the word is kangaroo ________ k_______ ka______ kan_____ kang____ kanga___ kangar__ kangaro_ kangaroo