Answer:
Explanation:
The following code is written in Java and creates the recursive function to find the longest common substring as requested.
static int lengthOfLongestSubsequence(String X, String Y) {
int m = X.length();
int n = Y.length();
if (m == 0 || n == 0) {
return 0;
}
if (X.charAt(m - 1) == Y.charAt(n - 1)) {
return 1 + lengthOfLongestSubsequence(X, Y);
} else {
return Math.max(lengthOfLongestSubsequence(X, Y),
lengthOfLongestSubsequence(X, Y));
}
}
Answer:
def calculate_pay(total_worked_hours, rate_per_hour):
if total_worked_hours > 40:
return (40 * rate_per_hour) + ((total_worked_hours - 40) * 2 * rate_per_hour)
else:
return total_worked_hours * rate_per_hour
Explanation:
- Create the calculate_pay function that takes 2 parameters.
- Inside the function check whether the total_worked_hours is greater than 40 and then return the pay by calculating with the help of formula for work over 40 hours.
- Otherwise return the pay by multiplying the total_worked_hours with rate_per_hour.
A) Marian Shelby. “The Fall of Rome.” Military Forces. n.p., 11 Mar 2009. Web.
14 Oct 2012.