Write a Python program that takes a String as an input and counts the frequency of each character using a dictionary. For solving this problem, you may use each character as a key and its frequency as values. [You are not allowed to use the count() function] Hint: You can create a new dictionary to store the frequencies. Ignore case for simplicity (i.e. consider P and p to be the same). keys need to be lower case Do not count space. Remove space before counting. example :  Sample Input: "Python programming is fun" Sample Output: {'p': 2, 'y': 1, 't': 1, 'h': 1, 'o': 2, 'n': 3, 'r': 2, 'g': 2, 'a': 1, 'm': 2, 'i': 2, 's': 1, 'f': 1, 'u': 1} def task11(in_str):   # YOUR CODE HERE         return dict_out # please use in_str and dict_out

There is a string of characters G = g1,g2,g3,...sn with no non-alphabetic characters (i.e no punctuation or spaces). You are also given a function dict(b,i,j), with an input of string b and two indices (i&j). This function will return true if bi...j is a word in the dictionary, and false if not. Please provide a simple dynamic programming solution that can determine if the string F is a sequence of valid dictionary words. State the size of the table, how the table is filled, which elements are filled in first, and where the solution is found. Please find the running time of the algorithm (assume that all calls to the function are O(1)).

Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice. You can return the answer in any order. please do in python

Write a program sorta that sorts and prints its arguments. sorta takes zero or more arguments,sorts them lexicographically, and then prints each argument on its own line.If sorta receives no arguments, it should exit without printing anything.You are free to use any sorting algorithm you find convenient, but sorta MUST use strcmp()for string comparison. Note that strcmp() uses lexicographical ordering (so a string comes afterits prefix) based on ASCII comparison of characters (so ‘Z’ comes before ‘a’). (See man strcmp for usage information.)  Treat the arguments (excluding argv[0]) as given: make no attempt to process or otherwise normalize the strings before sorting. Note that your shell will perform some manipulation on your input before passing the strings to your program, and most punctuation marks have special meanings: use escape sequences and/or quotation marks to avoid this. Program should not assume that it has received the proper number of arguments, for example, butshould…