Implement a CircularArray class that supports an array-like data structure which can be efficiently rotated. If possible, the class should use a generic type (also called a template), and should support iteration via the standard for (Obj o : circularArray) notation.

public class PokerAnalysis implements PokerAnalyzer {   privateList<Card>cards; privateint[]rankCounts; privateint[]suitCounts;   /** * The constructor has been partially implemented for you. cards is the * ArrayList where you'll be adding all the cards you're given. In addition, * there are two arrays. You don't necessarily need to use them, but using them * will be extremely helpful. *  * The rankCounts array is of the same length as the number of Ranks. At * position i of the array, keep a count of the number of cards whose * rank.ordinal() equals i. Repeat the same with Suits for suitCounts. For * example, if your Cards are (Clubs 4, Clubs 10, Spades 2), your suitCounts * array would be {2, 0, 0, 1}. *  * @param cards *            the list of cards to be added */ publicPokerAnalysis(List<Card>cards){ this.cards=newArrayList<Card>(); this.rankCounts=newint[Rank.values().length]; this.suitCounts=newint[Suit.values().length];…

Assume that, you have a Linked List class "LL" with a function named "fun1". You can assume that "value" is the value of the nodes and "Next" is the next pointer of the node. You created an instance of the LL class, named "L1", where "head" is the head node. And you inserted the following numbers:  31 -> 32 -> 43 -> 17 -> 34 -> 57 ->91. What will be the output of the linked list L1 after the "fun1" operation to it?*           31 -> 32 -> 43 -> 17 -> 34 -> 57 ->91       31 -> 32 -> 17 -> 34 -> 57 ->91       31 -> 32 -> 43 -> 17 -> 57 ->91       31 -> 32 -> 43 -> 17 -> 34 -> 57       31 -> 32 -> 43 -> 57 ->91       31 -> 32 -> 43 -> 34 -> 57 ->91

Given an JavaScript object list of books that each have a pages attribute to define the number of pages in the book, find the sum of all the pages in the object list of books using recursion. Keep in mind: The input list object may be completely empty (ex. {}) The next attribute may not be defined function getPageCount(list) {// your code here// returns an integer}Example test case:Input: {"book":"A","pages":1,"next":{"book":"B","pages":2,"next":{"book":"C","pages":3,"next": null}}}Output: 6Reasoning: 1 + 2 + 3 pages

Create your own vector class which will test algorithms  from the STL    Derive class myVector from vector. myVector must implement the following methods:         int seqSearch(T searchItem);   int binarySearch(T searchItem);   void bubbleSort();   void insertionSort(); Create a test program to create some vectors and test your methods above. Recall from your reading that binary search only works on a sorted list. Add a static member to the class to “remember” if the list is sorted ( i.e. binarySearch() should first sort the vector if it’s not sorted already). Use the template below as a starter for your assignment. All comments in bold represent code which you need to implement. #include <iostream> #include <string> #include <vector> using namespace std; template <class T> class myVector: public vector<T> {   public:   int seqSearch(T searchItem);   int binarySearch(T searchItem);   void bubbleSort();   void insertionSort(); }; template <class T>…

Define a constructor on the simpy class that takes a parameter of type list[float].Its purpose is to initialize the values attribute of the newly constructed simpy object to the argument passed in. Once your constructor is properly implemented, you expect to see [1.0, 1.0, 1.0, 1.0, 1.0] printed when evaluating the cell below. ones = Simpy([1., 1., 1., 1., 1.]) print(ones.values) 0.1s Python

Create a class called AddressBook that uses either C++ - Vector in the data section of the class. Since this is a template / generic type you need to make sure that you specify that ArrayList or vector  will hold a Person. You should use the Person class you created in Assignment 1.  Essentially, we are creating a collection class.  In other words, the AddressBook class will be a collection of Person classes.  Constructors AddressBook(); - default constructor. Should have no functionality.  AddressBook(string first, string last);  - Adds a Person class to the collection and sets address field to an empty string AddressBook(string first, string last, string address); - Adds a Person class to the collection. Mutators setPerson(string first, string last, string address); - Adds a Person to the collection Accessors C++  All accessors will return a pointer to a Person Person *getPerson(); - Returns the next Person in the collection. Each time this function is called it will return the…

Write a template function that takes as parameter a vector of a generic type and reverses the order of elements in the vector, and then add the function to the program you wrote for Programming Challenge 5. Modify the driver program to test the new function by reversing and outputting vectors whose element types are char, int, double, and string.

Add the function min as an abstract function to the class arrayListType to return the smallest element of the list. Also, write the definition of the function min in the class unorderedArrayListType and write a program to test this function. I have 5 tabs: I have tried every solution I can think of with no luck. These are the guides: arrayListType.h arrayListTypeImp.cpp: main.cpp unorderedArraryListType.h unorderedArrayListTypeImp.cpp I am needing these in order to pass the assignment in Cengage Mindtap, please help with codes for each one if possible.

Nonscalar types, such as arrays, records (structures), and variant records (unions) also contain information. The rules for information flow classes for these data types are built on the scalar types. Consider the array a: array 1 .. 100 of int; First, look at information flows out of an element a[i] of the array. In this case, information flows from a[i] and from i, the latter by virtue of the index indicating which element of the array to use. Information flows into a[i] affect only the value in a[i], and so do not affect the information in i. Thus, for information flows from a[i], the class involved is lub{ a[i], i }; for information flows into a[i], the class involved is a[i]. Above is the infromation flow security mechanism for arrays similarly write one for structures/Records. Below is the small info on Structures. The structure consists of several fields, each of which acts like a variable. Say you have a structure with two integer fields, x and y. You want to assign the value…