Please help with the following:

**ASAP**

(WILL LEAVE A LIKE)

Use the dynamic programming method to compute the edit distance between BRIDGE and CRIME. To get full credit, you need to sketch the whole table and find values of E(ij) for each vertex/box. You need to mark clearly the obtained optimal alignment and the corresponding edit distance. Use the dynamic programming method to compute the edit distance between BRIDGE and CRIME. To get full credit, you need to sketch the whole table and find values of E(ij) for each vertex/box. You need to mark clearly the obtained optimal alignment and the corresponding edit distance