Compatible StringsCompatible Strings Two strings A and B comprising of lower case English letters are compatible if they are equal or can be made equal by following this step any number of times:Select a prefix from the string A, and increase the alphabetical value of all the characters in the prefix by the same valid amount. For example, if the string is ashzb and we select the prefix ash then we can convert it to bti by increasing the alphabetical value by 1. If we select the prefix ashzb, then it will be converted into btiac. Your task is to determine if given strings A and B are compatible. Input formatRead N.Read N pairs of strings, each in a separate line . Output formatFor each pair of input strings,print YES if string A can be converted to string B, otherwise print NO. SAMPLE INPUT3abacacdbdagodzjneaaqlmcmmo SAMPLE OUTPUTYESNONO

You have given two strings 'A' and ‘B’ of length ‘N’ each which only consists of lowercase English letters. You have also given an integer ‘K’.Your task is to determine if it is possible to convert string ‘A’ into ‘B’ after performing two types of operations on it:1. Choose an index i (1 <= i <= N - 1) and swap A[i] and A[i+1].2. Choose an index i (1 <= i <= N - K + 1) and if A[i], A[i+1],. . . . , A[i+K-1] all are equal to some character x (x != ‘z’), then you can replace each one with the next character (x + 1) , i.e. ‘a’ is replaced by ‘b’, ‘b’ is replaced by ‘c’ and so on.Note:You are allowed to perform any operation any number of times(possibly zero) only on string 'A'.

Given 2 strings A and B, check if A is present as a subsequence in B.

Write a Python program that matches a string that has an 'a' followed by anything, ending in 'b'

Construct the Moore Machines that will count occurrences of substring 'ab' over the input ∑ = {a,b} and convert into Mealy Machine.

Given two strings s and t, determine if they are isomorphic.Two strings s and t are isomorphic if the characters in s can be replaced to get t.All occurrences of a character must be replaced with another character while preserving the order of characters. No two characters may map to the same character, but a character may map to itself. Example 1:Input: s = "egg", t = "add"Output: trueExample 2:Input: s = "foo", t = "bar"Output: falseExample 3:Input: s = "paper", t = "title"Output: true Constraints:1 <= s.length <= 5 * 104t.length == s.lengths and t consist of any valid ascii character.