Here is a pseudo-code that works over two strings, STRING1 and STRING2, represented as an array of characters with sufficient sizes. length is a function that computes the length of a string. What does the code do to the input strings? 1. LENGTH1 = length(STRING1); 2. LENGTH2 = length(STRING2); 3. for POSITION = 1 to LENGTH2 4. LENGTH1 = LENGTH1+1; 5. STRING1[LENGTH1]=STRING2[POSITION]; 6. end

Make Camel Case.  Create a program that reads a multi-word phrase, and prints the Camel Case equivalent. For example, for input “total account balance” the program shall output “totalAccountBalance”.Notice that the first word is in lowercase (even if it contains uppercase letters). The rest of the words, only their initials are capitalized.

When we say arithmetic expression, we mean a kind of expression you can type in a very basic desk calculator. That is, neither variables nor brackets are allowed. It contains only numbers and four arithmetic operators, +, -, *, and /.   The following are some examples of arithmetic expression:   Any number string with or without signs - e.g. 3, -1, +10, 3.14, -0.70 and 099. Number strings mixed with arithmetic operators - e.g. 3+5, -1+2*3, 7/10-0.7, and -1.4-+8.2.   An example of FA diagram for recognising a non-negative integer is given below. You may use it as a start point. You need to add a few more states and transitions to handle numbers with decimal point and signs (e.g. -5, +2, 0.21, -32.6, +99.05, but not the form 1.0E-3). Most importantly, you also need to add a few more things to deal with the arithmetic operators +, -, *, /.

Write a regular expression that defines strings that have an even (but nonzero) number of "a" characters followed by an odd number of "b" characters. For example, aab, aabbb, aaaab, and aaaabbb should all match the regular expression.