Java.. Coding a simple

Building a simple Automated Bug Detection Tool: This project involves using the concept of "likely-invariants" from call graphs. We will need to determine what pairs of functions are called together. Then, we will use likely-invariants to automatically detect software bugs. Please check the project pdf attached. Only the coding of Part (I) (a) is required for this project. Note that skeleton code will be provided as well. You are given a call graph which displays various functions calls such as: void scope1() { A(); B(); C(); D(); } void scope2() { A(); C(); D(); } void scope3() { A(); B(); B(); } void scope4() { B(); D(); scope1(); } void scope5() { B(); D(); A(); } void scope6() { B(); D(); } } We can see that certain functions are called with other functions, such as A() with B() are called together three times in function scope1, scope3, and scope5. We can call "support" as the number of times a pair of functions appears together. Thus, support({A,B}) is 3. We can call "confidence" as support{A,B}/support{A} = 3/4 or 75%. Using Java, you will need to parse the callgraph above and generate output that determines whether there is a bug based on the values of support and confidence. If the values of support and confidence passed in are 3 and 65%, and we find that pair (A, B) in scope 2 has a support of 3 and a confidence of 75%, we can report that as a bug in the output. All the details are in the project pdf which is attached. The coding of Part (I) (a) is the only work required for this project. All other questions are not required. Only the coding Question 1a. The skeleton code will be provided as well. This project mainly requires building the parser tool written in java. It is a short project.