Let σ be an alphabet set of size k, and a = a1 · · · am and b = b1 · · · bn be two strings over σ with length m and n, respectively. design a dynamic programming based algorithm to convert a into b with minimum cost using the following rules. for a cost of dk/3e, one can delete any letter from a string. for a cost of dk/2e, one can insert a letter in any position. for a cost of |rank(a)−rank(b)|, one can replace a letter a by another letter b, where rank(a) and rank(b) are the ranks of a and b in σ (i. e., the ranks of 3 and 5 are 2 and 3, respectively, in an alphabet of {1, 3, 5, 7}).

This program should be a short piece of code that prints all of the positive integers from 1 to 100 as described more fully below. the program may contain multiple methods, and if using an oo language, should be contained within a single class or object. the program should be designed so that it begins execution when invoked through whichever mechanism is most common for the implementation language. â–ş print out all positive integers from 1 to 100, inclusive and in order. â–ş print messages to standard output, matching the sample output below. â–ş in the output, state whether the each integer is 'odd' or 'even' in the output. â–ş if the number is divisible by three, instead of stating that the number is odd or even, state that the number is 'divisible by three'. â–ş if the number is divisible by both two and three, instead of saying that the number is odd, even or divisible by three; state that the number is 'divisible by two and three'. â–ş design the logic of the loop to be as efficient as possible, using the minimal number of operations to perform the required logic. sample output the number '1' is odd. the number '2' is even. the number '3' is divisible by three. the number '6' is divisible by two and three.

The first time a user launches the powerpoint program, which view is shown allowing the user to access recent presentations or create new presentations based on templates?

Why might you choose to create a functional resume