Finding the longest common substring in two strings is a problem that lends itself to a dynamic programming solution. For example, the longest common substring in the terms "raven" and "havoc" is "av". Create a whole programme in C# for it.

IN HASKELL PROGRAMMING LANGUAGE PLEASE     In case you do not know it: the game is played on a 3x3 grid that is initially empty. Two players are playing, by alternatingly making moves. A move by a player places their token (an X for player 1, an O for player 2) into a cell that was empty. We are using algebraic notations for indexing the positions in the board, with A,B,C indexing the columns and 1,2,3 the rows. Specifically, these coordinates would be used in the implementation for moves made by a human player. If the X X O Figure 1: Sample board position same token appears 3 times in any of the three columns, three rows or two main diagonals the game is over and that player wins. If the grid is filled without that happening the game is a draw. For the depicted board, we have Xs in positions C3 and A2, and an O in position B1. It would be O’s turn to make a move; a legal move would be C2, but it is not a good move, because X can force a win by responding A1. O cannot force a win, but…

Make a list of all the ways that dynamic programming and the divide-and-conquer approach are different.

Write a C# program to control the Payroll System  (Application of Polymorphism).

use The C Programming Language Online Compile for Recamán's Sequence Implement this in a program. Write two functions, one for solving it iteratively, one for solving it recursively. Take two arguments from the command-line: an "i" or "r", and the term number (how many terms to print). Print out which method executed (was selected) and all the terms (and the number of terms).