Data structure:Using Java, 5. Write a program that checks whether a sequence of HTML tags is properlynested. For each opening tag, such as , there must be a closing tag .A tag such as may have other tags inside, for example The inner tags must be closed before the outer ones. Your program shouldprocess a file containing tags. For simplicity, assume that the tags areseparated by spaces, and that there is no text inside the tags.

using linked list Linked list is a linear data structure in which elements are not stored at contiguous memory locations. import java.util.LinkedList; import java.util.List; public class Main { public static boolean isBalancedHtml(String html) { List<String> tagList = new LinkedList<>(); String lines[] = html.split("\\n"); for (int i = 0; i < lines.length; i++) { String line = lines[i]; while (line.indexOf("<") != -1) { int startIndex = line.indexOf("<"); if (startIndex == -1) { break; } boolean isClosingTag = line.charAt(startIndex + 1) == '/'; int endIndex = line.indexOf(">"); if (endIndex == -1 || endIndex > line.length()) { break; } String tag = line.substring(startIndex+1, endIndex); String tagName = ""; if (isClosingTag) { tagName = line.substring(startIndex+2, endIndex); } else { tagName = tag.split(" ")[0]; } if (isClosingTag) { String lastTagInList = tagList.get(tagList.size()-1); if (!lastTagInList.equals(tagName)) { return false; } tagList.remove(tagList.size()-1); } else { tagList.add(tagName); } line = line.substring(endIndex + 1); } } return tagList.isEmpty(); } public static void main(String[] args) { String htmlContent = "<img title=\"pictures\" src=\"test.jpg\"></img><p> <ul> <li> </li> </ul> <a> </a> </p>"; System.out.println("Html content: " + htmlContent); if (isBalancedHtml(htmlContent)) { System.out.println("HTML conent is balanced"); } else { System.out.println("Html content is not balanced"); } }}