(page 91 from out "Cracking the coding interview[...]" textbook): One Away: There are three types of edits that can be performed on strings: insert a character, remove a character, or replace a character. Given two strings, write a function to check if they are one edit (or zero edits) away. This is also called a Levenshtein distance of 1. Assume the input is a string with two words separated by white space. EXAMPLE pale, pIe -> true pales, pale -> true pale, bale -> true pale, bake -> false

Please be sure to answer with meaningful commentary and code as needed. Will be sure to upvote! (In C#)