Code in java

A gene string can be represented by an 8-character long string, with choices from "A", "C", "6", "I". Suppose *r need to investigate about a mutation (mutation from 'start' to "end"), where ONE mutation is defined as ONE single character For example, "AACCGGTT" rightarrow "AACCGGTA" is 1 mutation. Also, there is a given gene "bank", which records all the valid gene notations. A gene must be in the bark to awake it a valid gene string. Now, given 3 things - start, cod, bank, your task is to determine what is the minimum number of Mutations needed to mutate from "start" to If there is no such a mutation, return -1. If the start and end string are the same, return 0. Example: start: "AACCGGTT" end: "AAACGGTA" bank: ["AACCGGTA", "AACCGCTA", "AAACGGTA"] return: 2 Organize your solution into a driver class (with a main method) and utility class containing the logical implementation. Points will be docked for code that's too tightly coupled