Solution Java SE Write a function: /1 you can also use imports, for example: 2 Iimport java.util. class Solution( pablic int solution(String s, String T): h 4 1/ you can write to stdout for debugging purposes, e.g 5 System.out.printin this is a debug message") that, given a string S and a string T, returns 1 if it's possible to convert string S into string T by deleting some (possibly zero) characters from string S, and otherwise returns 0 7 - class Solution 8- public int solution(String S, String T) // write your code in Java SE 8 10 For example, given S abcd and T-"abd" the function should return 1. We can delete'c from string S to convert string S into string T Given S-ab and T-'ba the function should return 0 Assume that: the length of (S', T) is within the range [1. 1,000 strings S and T consist only of lower-case letters (a-z In your solution, focus on correctness. The performance of your s Output solution will not be the focus of the assessment