Write java program to store any given graph using the following strategies: Task 2. Adjacency List using ragged array. Your program must ask the number of vertices and then the list of vertices to store. Afterwards, the adjacent vertices to each of the vertex to store the information. You may consider the following simple graph to test your program. b A sample output for Task 2 is given below. Enter number of vertices: 3 Enter list of vertices: ABC How many edges are associated with A 2 Enter adjacent vertices to A BC How many edges are associated with B 2 Enter adjacent vertices to B AC How many edges are associated with C 2 Enter adjacent vertices to C BC 12 02 12 с

in C programing  Write a recursive function that returns 1 if an array of size n is in sorted order and 0 otherwise. Note: If array a stores 3, 6, 7, 7, 12, then isSorted(a, 5) should return 1 . If array b stores 3, 4, 9, 8, then isSorted(b,4) should return 0.int isSorted(int *array, int n){

Given a list of integers, we want to know whether it is possible to choose a subset of some of the integers, such that the integers in the subset adds up to the given sum recursively. We also want that if an integer is chosen to be in the sum, the integer next to it in the list must be skipped and not chosen to be in the sum. Do not use any loops or regular expressions. Test cases: skipSum([2, 5, 10, 6], 12) true skipSum([2, 5, 10, 6], 7) false skipSum([2, 5, 10, 6], 16) false Given code: public static boolean skipSum (List list, int sum) { // call your recursive helper method return skipSumHelper (list, e, sum); 1. 2. 3. 4.

Personal project Q5. This question is concerned with the design and analysis of recursive algorithms. You are given a problem statement as shown below. This problem is concerned with performing calculations on a sequence ? of real numbers. Whilst this could be done using a conventional loop-based approach, your answer must be developed using a recursive algorithm. No marks will be given if your answer uses loops. FindAverageAndProduct(a1, ...., an) such that n > 1 Input: A sequence of real values A = (a1, ..., an) Output:, A 2-tuple (average, product) containing the average (average) of all the values and the product (product) of all the values of the elements in A. Your recursive algorithm should use a single recursive structure to find the average and product values, and should not use two separate instances of a recursive design. You should not employ any global variables. (a) Produce a pseudo code design for a recursive algorithm to solve this problem.   (b) Draw a call-stack…

Java

The Eight Queen Problem is to find a solution to place a queen in each row on a chessboard such that no queens can attack each other. write a program to solve the eight queen problem using the recursion and display the result. Program in java

I need the code from start to end with no errors and the explanation for the code ObjectivesJava refresher (including file I/O)Use recursionDescriptionFor this project, you get to write a maze solver. A maze is a two dimensional array of chars. Walls are represented as '#'s and ' ' are empty squares. The maze entrance is always in the first row, second column (and will always be an empty square). There will be zero or more exits along the outside perimeter. To be considered an exit, it must be reachable from the entrance. The entrance is not an exit.Here are some example mazes:mazeA7 9# # ###### # #   ## # # #### #     ## ##### ##       ########## RequirementsWrite a MazeSolver class in Java. This program needs to prompt the user for a maze filename and then explore the maze. Display how many exits were found and the positions (not indices) of the valid exits. Your program can display the valid exits found in any order. See the examples below for exact output requirements. Also, record…

What is the answer in C programming language (not C++)?

In Python the only import that may be used is Numpy Implement a function called page_rank which will take as input a numpy array M, which will represent the transition matrix of a directed graph, and a positive integer n. The output will be a numpy array which gives the page ranks of each vertex in the graph represented by M. You will iterate the update process n times.

Please follow the instructions in the screenshots provided and use that to implement the code given below. Done in python 3.10 or later please.    class WeightedAdjacencyMatrix :    """A weighted graph represented as a matrix."""     __slots__ = ['_W']     def __init__(self, size, edges=[], weights=[]) :        """Initializes a weighted adjacency matrix for a graph with size nodes.         Graph is initialized with size nodes and a specified set of        edges and edge weights.                Keyword arguments:        size -- Number of nodes of the graph.        edges -- a list of ordered pairs (2-tuples) indicating the                 edges of the graph.  The default value is an empty list                 which means no edges by default.        weights -- a list of weights for the edges, which should be the same                   length as the edges list.  The position of a value in                   the weights list corresponds to the edge in the same                   position of…