Write a python program that will accept monthly salary amounts greater than zero but less than or equal to 400,000.00 until the user enters the character ‘e’. After the user

enters the character ‘e’, calculate the net pay of all salaries by deducting income tax at

a rate of 25%, pension of 5% and housing contribution of 2% from each salary

entered. Additionally, print the number of salaries that were entered in the program

along with the number of salaries that exceed 300,000.00

write a python program
The English alphabet has 26 letters starting from A and ending with Z. If we map the

first 26 numbers i. e 1 through to 26 to each letter in the alphabet, we could encode

messages using numbers. For example, 123 could be represented as ‘ABC’ and 26 could

be the letter ‘Z’. Write a program that accepts 10 integers from the user ranging from 1

- 26. After accepting the values, the program should determine and print the

corresponding letters.​

The liang book has an example called which is a javafx application that reads the javabook database using a preparedstatement object. using it as a guide, create a similar application called findbooks. it will read a list of authors from the bookdb created in problem 1 and display them in a listview. if the user selects an author, it should display the author's book titles in a textarea.

Show that there is a language a ⚆ {0, 1} â— with the following properties: 1. for all x â a, |x| ≤ 5. 2. no dfa with fewer than 9 states recognizes a. hint: you don’t have to define a explicitly; just show that it has to exist. count the number of languages satisfying (1) and the number of dfas satisfying (2), and argue that there aren’t enough dfas to recognize all those languages. to count the number of languages satisfying (1), think about writing down all the strings of length at most 5, and then to define such a language, you have to make a binary decision for each string about whether to include it in the language or not. how many ways are there to make these choices? to count the number of dfas satisfying (2), consider that a dfa behaves identically even if you rename all the states, so you can assume without loss of generality that any dfa with k states has the state set {q1, q2, . . , qk}. now think about how to count how many ways there are to choose the other four parts of the dfa.

In my email i got a message it says a quick message and in message details on who its from its says nicole and under nicole is 50e0bf08e5b671@ualwgypg91wa5wl. uzo9kbud3qjwddygd5.vng -