Obtain DFA to accept strings whose length is multiple of 3 on sum={a,b} i.e L=}w||w| mod 3=0}

ML / SML Code only please! If ELSE FORMAT. DO NOT COPY USE THE OTHER ANSWERS ON CHEGG. THEY'RE WRONG. Write a function delnthc to delete the n-th character of a string. You may assume that the input string is always longer than n.delnthc("abcdef", 4) → "abcef" Write a function multin to take a list of three [a,b,c] and multiplies a by b c times. Function definition must look like multin(L)! CAN NOT USE multin(a,b,c). You have to use let-in-end in if-then-else style NOT @CAN NOT USE function power(a,b) =a*a*a...,multin [2,3,5] → [2,6,18,54,162,486] Write a function pairStar to form a new string where identical chars thatare adjacent in the original string are separated from each other by a "*"pairStar("xxyy") → "x*xy*y", pairStar("aaaa") → "a*a*a*a"

Complete the given CPP function definition and run it for a test case. void swapString(string &str, int i, int j) { //check whether i and j are in the range //0 to str.length ()-1 and i is less than j. //if the conditions are true then swap the //characters at index i and j in the string. }

a,d,e. please show all stps