Give a natural definition for the inverse of a binary relation such that if a relation is in fact a bijective function, its relational inverse is its functional inverse.

Give a natural definition for the inverse of a binary relation such that if a relation is in fact a bijective function, its relational inverse is its functional inverse.

(Test perfect binary tree) A perfect binary tree is a complete binary tree with all levelsfully filled. Define a new class named BSTWithTestPerfect thatextends BST with the following methods: (Hint: The number of nodesin a perfect binary tree is 2^(height+1) - 1.) /** Returns true if the tree is a perfect binary tree */ publicboolean isPerfectBST() Use the code below to test the code. Please only answer with theportions that go between // BEGIN REVEL SUBMISSION and // END REVELSUBMISSION Class Name: Exercise25_03 /* You have to use the following template to submit to Revel. Note: To test the code using the CheckExerciseTool, you will submit entire code. To submit your code to Revel, you must only submit the code enclosed between // BEGIN REVEL SUBMISSION // END REVEL SUBMISSION*/ import java.util.*;public class Exercise25_03 { public static void main(String[] args) { BSTWithTestPerfect tree = new BSTWithTestPerfect(); System.out.print("Is an empty tree prefect? " + tree.isPerfectBST()); tree.insert("Green"); System.out.print("\nIs a one-node tree prefect? " + tree.isPerfectBST()); tree.insert("Red"); System.out.print("\nIs a two-node tree prefect? " + tree.isPerfectBST()); Scanner input = new Scanner(System.in); System.out.print("\nEnter a string: "); String s = input.next(); tree.insert(s.trim()); System.out.print("Is this tree perfect? " + tree.isPerfectBST()); BSTWithTestPerfect tree1 = new BSTWithTestPerfect(new String[] {"Tom", "George", "Jean", "Jane", "Kevin", "Peter", "Susan", "Jen", "Kim", "Michael", "Michelle"}); System.out.print("\nIs tree1 perfect? " + tree1.isPerfectBST()); BSTWithTestPerfect tree2 = new BSTWithTestPerfect(new Integer[]{50, 45, 75, 18, 49, 51, 98}); System.out.print("\nIs tree2 perfect? " + tree2.isPerfectBST()); }}interface Tree extends java.util.Collection { /** Return true if the element is in the tree */ public boolean search(E e); /** Insert element o into the binary tree * Return true if the element is inserted successfully */ public boolean insert(E e); /** Delete the specified element from the tree * Return true if the element is deleted successfully */ public boolean delete(E e); /** Get the number of nodes in the tree */ public int getSize(); /** Inorder traversal from the root*/ public default void inorder() { } /** Postorder traversal from the root */ public default void postorder() { } /** Preorder traversal from the root */ public default void preorder() { } @Override /** Return true if the tree is empty */ public default boolean isEmpty() { return size() == 0; }; @Override public default boolean contains(Object e) { return search((E)e); } @Override public default boolean add(E e) { return insert(e); } @Override public default boolean remove(Object e) { return delete((E)e); } @Override public default int size() { return getSize(); } @Override public default boolean containsAll(Collection c) { // Left as an exercise return false; } @Override public default boolean addAll(Collection c) { // Left as an exercise return false; } @Override public default boolean removeAll(Collection c) { // Left as an exercise return false; } @Override public default boolean retainAll(Collection c) { // Left as an exercise return false; } @Override public default Object[] toArray() { // Left as an exercise return null; } @Override public default T[] toArray(T[] array) { // Left as an exercise return null; }}class BST implements Tree { protected TreeNode root; protected int size = 0; protected java.util.Comparator c; /** Create a default BST with a natural order comparator */ public BST() { this.c = new Comparator() { public int compare(E e1, E e2) { return ((Comparable)e1).compareTo(e2); } }; } /** Create a BST with a specified comparator */ public BST(java.util.Comparator c) { this.c = c; } /** Create a binary tree from an array of objects */ public BST(E[] objects) { this(); for (int i = 0; i < objects.length; i++) add(objects[i]); } @Override /** Returns true if the element is in the tree */ public boolean search(E e) { TreeNode current = root; // Start from the root while (current != null) { if (c.compare(e, current.element) < 0) { current = current.left; } else if (c.compare(e, current.element) > 0) { current = current.right; } else // element matches current.element return true; // Element is found } return false; } @Override /** Insert element e into the binary tree * Return true if the element is inserted successfully */ public boolean insert(E e) { if (root == null) root = createNewNode(e); // Create a new root else { // Locate the parent node TreeNode parent = null; TreeNode current = root; while (current != null) if (c.compare(e, current.element) < 0) { parent = current; current = current.left; } else if (c.compare(e, current.element) > 0) { parent = current; current = current.right; } else return false; // Duplicate node not inserted // Create the new node and attach it to the parent node if (c.compare(e, parent.element) < 0) parent.left = createNewNode(e); else parent.right = createNewNode(e); } size++; return true; // Element inserted successfully } protected TreeNode createNewNode(E e) { return new TreeNode(e); } @Override /** Inorder traversal from the root */ public void inorder() { inorder(root); } /** Inorder traversal from a subtree */ protected void inorder(TreeNode root) { if (root == null) return; inorder(root.left); System.out.print(root.element + " "); inorder(root.right); } @Override /** Postorder traversal from the root */ public void postorder() { postorder(root); } /** Postorder traversal from a subtree */ protected void postorder(TreeNode root) { if (root == null) return; postorder(root.left); postorder(root.right); System.out.print(root.element + " "); } @Override /** Preorder traversal from the root */ public void preorder() { preorder(root); } /** Preorder traversal from a subtree */ protected void preorder(TreeNode root) { if (root == null) return; System.out.print(root.element + " "); preorder(root.left); preorder(root.right); } /** This inner class is static, because it does not access any instance members defined in its outer class */ public static class TreeNode { protected E element; protected TreeNode left; protected TreeNode right; public TreeNode(E e) { element = e; } } @Override /** Get the number of nodes in the tree */ public int getSize() { return size; } /** Returns the root of the tree */ public TreeNode getRoot() { return root; } /** Returns a path from the root leading to the specified element */ public java.util.ArrayList> path(E e) { java.util.ArrayList> list = new java.util.ArrayList(); TreeNode current = root; // Start from the root while (current != null) { list.add(current); // Add the node to the list if (c.compare(e, current.element) < 0) { current = current.left; } else if (c.compare(e, current.element) > 0) { current = current.right; } else break; } return list; // Return an array list of nodes } @Override /** Delete an element from the binary tree. * Return true if the element is deleted successfully * Return false if the element is not in the tree */ public boolean delete(E e) { // Locate the node to be deleted and also locate its parent node TreeNode parent = null; TreeNode current = root; while (current != null) { if (c.compare(e, current.element) < 0) { parent = current; current = current.left; } else if (c.compare(e, current.element) > 0) { parent = current; current = current.right; } else break; // Element is in the tree pointed at by current } if (current == null) return false; // Element is not in the tree // Case 1: current has no left child if (current.left == null) { // Connect the parent with the right child of the current node if (parent == null) { root = current.right; } else { if (c.compare(e, parent.element) < 0) parent.left = current.right; else parent.right = current.right; } } else { // Case 2: The current node has a left child // Locate the rightmost node in the left subtree of // the current node and also its parent TreeNode parentOfRightMost = current; TreeNode rightMost = current.left; while (rightMost.right != null) { parentOfRightMost = rightMost; rightMost = rightMost.right; // Keep going to the right } // Replace the element in current by the element in rightMost current.element = rightMost.element; // Eliminate rightmost node if (parentOfRightMost.right == rightMost) parentOfRightMost.right = rightMost.left; else // Special case: parentOfRightMost == current parentOfRightMost.left = rightMost.left; } size--; // Reduce the size of the tree return true; // Element deleted successfully } @Override /** Obtain an iterator. Use inorder. */ public java.util.Iterator iterator() { return new InorderIterator(); } // Inner class InorderIterator private class InorderIterator implements java.util.Iterator { // Store the elements in a list private java.util.ArrayList list = new java.util.ArrayList(); private int current = 0; // Point to the current element in list public InorderIterator() { inorder(); // Traverse binary tree and store elements in list } /** Inorder traversal from the root*/ private void inorder() { inorder(root); } /** Inorder traversal from a subtree */ private void inorder(TreeNode root) { if (root == null) return; inorder(root.left); list.add(root.element); inorder(root.right); } @Override /** More elements for traversing? */ public boolean hasNext() { if (current < list.size()) return true; return false; } @Override /** Get the current element and move to the next */ public E next() { return list.get(current++); } @Override // Remove the element returned by the last next() public void remove() { if (current == 0) // next() has not been called yet throw new IllegalStateException(); delete(list.get(--current)); list.clear(); // Clear the list inorder(); // Rebuild the list } } @Override /** Remove all elements from the tree */ public void clear() { root = null; size = 0; }}// BEGIN REVEL SUBMISSIONclass BSTWithTestPerfect extends BST { /** Create a default BST with a natural order comparator */ public BSTWithTestPerfect() { super(); } /** Create a BST with a specified comparator */ public BSTWithTestPerfect(java.util.Comparator c) { super(c); } /** Create a binary tree from an array of objects */ public BSTWithTestPerfect(E[] objects) { super(objects); } /** * Returns the height of this binary tree. */ public int height() { return height(root); } private int height(TreeNode root) { // WRITE YOUR CODE HERE } /** Returns true if the tree is a perfect binary tree */ public boolean isPerfectBST() { // WRITE YOUR CODE HERE }}// END REVEL SUBMISSION

****IN C PLEASE NOT C++**** ======================== 17.12 LAB*: Program: Playlist Instructor note: Function Prototypes void CreatePlaylistNode(PlaylistNode* thisNode, char[], char[], char[], int, PlaylistNode* nextNode); void InsertPlaylistNodeAfter(PlaylistNode* thisNode, PlaylistNode* newNode); void SetNextPlaylistNode(PlaylistNode* thisNode, PlaylistNode* newNode); PlaylistNode* GetNextPlaylistNode(PlaylistNode* thisNode); void PrintPlaylistNode(PlaylistNode* thisNode); You will be building a linked list. Make sure to keep track of both the head and tail nodes. (1) Create three files to submit. PlaylistNode.h - Struct definition and related function declarations PlaylistNode.c - Related function definitions main.c - main() function Build the PlaylistNode class per the following specifications. Note: Some functions can initially be function stubs (empty functions), to be completed in later steps. Private data members char uniqueID[50] char songName[50] char artistName[50] int songLength PlaylistNode* nextNodePtr Related functions CreatePlaylistNode() (1 pt) InsertPlaylistNodeAfter() (1 pt) Insert a new node after node SetNextPlaylistNode() (1 pt) Set a new node to come after node GetNextPlaylistNode() Return location pointed by nextNodePtr PrintPlaylistNode() Ex. of PrintPlaylistNode output: Unique ID: S123 Song Name: Peg Artist Name: Steely Dan Song Length (in seconds): 237 (2) In main(), prompt the user for the title of the playlist. (1 pt) Ex: Enter playlist's title: JAMZ (3) Implement the PrintMenu() function. PrintMenu() takes the playlist title as a parameter and outputs a menu of options to manipulate the playlist. (1 pt) Ex: JAMZ PLAYLIST MENU a - Add song r - Remove song c - Change position of song s - Output songs by specific artist t - Output total time of playlist (in seconds) o - Output full playlist q - Quit (4) Implement the ExecuteMenu() function that takes 3 parameters: a character representing the user's choice, a playlist title, and the pointer to the head node of a playlist. ExecuteMenu() performs the menu options (described below) according to the user's choice, and returns the pointer to the head node of the playlist.(1 pt) (5) In main(), call PrintMenu() and prompt for the user's choice of menu options. Each option is represented by a single character. If an invalid character is entered, continue to prompt for a valid choice. When a valid option is entered, execute the option by calling ExecuteMenu() and overwrite the pointer to the head node of the playlist with the returned pointer. Then, print the menu, and prompt for a new option. Continue until the user enters 'q'. Hint: Implement Quit before implementing other options. (1 pt) Ex: JAMZ PLAYLIST MENU a - Add song r - Remove song c - Change position of song s - Output songs by specific artist t - Output total time of playlist (in seconds) o - Output full playlist q - Quit Choose an option: (6) Implement "Output full playlist" menu option in ExecuteMenu(). If the list is empty, output: Playlist is empty (3 pts) Ex: JAMZ - OUTPUT FULL PLAYLIST 1. Unique ID: SD123 Song Name: Peg Artist Name: Steely Dan Song Length (in seconds): 237 2. Unique ID: JJ234 Song Name: All For You Artist Name: Janet Jackson Song Length (in seconds): 391 3. Unique ID: J345 Song Name: Canned Heat Artist Name: Jamiroquai Song Length (in seconds): 330 4. Unique ID: JJ456 Song Name: Black Eagle Artist Name: Janet Jackson Song Length (in seconds): 197 5. Unique ID: SD567 Song Name: I Got The News Artist Name: Steely Dan Song Length (in seconds): 306 (7) Implement the "Add song" menu option in ExecuteMenu(). New additions are added to the end of the list. (2 pts) Ex: ADD SONG Enter song's unique ID: SD123 Enter song's name: Peg Enter artist's name: Steely Dan Enter song's length (in seconds): 237 (8) Implement the "Remove song" menu option in ExecuteMenu(). Prompt the user for the unique ID of the song to be removed.(4 pts) Ex: REMOVE SONG Enter song's unique ID: JJ234 "All For You" removed. (9) Implement the "Change position of song" menu option in ExecuteMenu(). Prompt the user for the current position of the song and the desired new position. Valid new positions are 1 - n (the number of nodes). If the user enters a new position that is less than 1, move the node to the position 1 (the head). If the user enters a new position greater than n, move the node to position n (the tail). 6 cases will be tested: Moving the head node (1 pt) Moving the tail node (1 pt) Moving a node to the head (1 pt) Moving a node to the tail (1 pt) Moving a node up the list (1 pt) Moving a node down the list (1 pt) Ex: CHANGE POSITION OF SONG Enter song's current position: 3 Enter new position for song: 2 "Canned Heat" moved to position 2 (10) Implement the "Output songs by specific artist" menu option in ExecuteMenu(). Prompt the user for the artist's name, and output the node's information, starting with the node's current position. (2 pt) Ex: OUTPUT SONGS BY SPECIFIC ARTIST Enter artist's name: Janet Jackson 2. Unique ID: JJ234 Song Name: All For You Artist Name: Janet Jackson Song Length (in seconds): 391 4. Unique ID: JJ456 Song Name: Black Eagle Artist Name: Janet Jackson Song Length (in seconds): 197 (11) Implement the "Output total time of playlist" menu option in ExecuteMenu(). Output the sum of the time of the playlist's songs (in seconds). (2 pts) Ex: OUTPUT TOTAL TIME OF PLAYLIST (IN SECONDS) Total time: 1461 seconds

1. Why has Chase Sapphire Reserve been so successful in acquiring customers? Discuss in terms of functional, social, ego-expressive, experiential and economic values provided by the Reserve card. Will this success continue over time? Why or why not? What changes would you make to their customer acquisition strategy going forward? 2.How would you evaluate the introductory 100,000 point sign up bonus? Do you think it was a good or bad acquisition investment for Chase? 3. What marketing strategies should Chase employ to maximize customer lifetime value (CLV) for each of the three groups of customers? Note that CLV is a function of margin, churn and acquisition costs. Given the high acquisition costs associated with Reserve, how can Codispoti increase revenue, reduce expenses, and/or improve retention for transactors, revolvers and churners? What changes to the product would you recommend?

PMU facilitates a catalog of books for its faculty and students. Several books are available for the students and faculty members. • Catalog has a pool of books of different authors. • The faculty members and students can access books depending on the availability. • Each book has a unique code. You should provide functions to support the following operations: 1. The book administrator can add new books and its information. 2. The book administrator can remove and update the information the books. 3. The faculty and students can inquire about the specific books including the author information. 4. The faculty and students can request for a new book. 5. The book administrator can update the requests or new requirements from the faculty or the students. 6. The faculty and the students can raise a complain about the non-availability of the books or any other. 7. The book administrator can generate the reports of the book based on: a. Book title b. Book Author c. Book ISBN 8. The system should be able to handle other kinds of reports to be generated in the future. You should create three classes, one for Book, the second for Administrator and the third for Users. Use the linked list and the files for database. NO arraylist. Must use linkedlist and Java FileWriter Project Output Screen: When I run the project, it should look like the following: Please select the user: 1. Administrator 2. User After selecting administrator, the following menu should be displayed: • Add new books and its information. • Delete the information of the books. • Update the requests or new requirements from the faculty or the students. • Generate the reports of the book based on: a. Book title b. Book Author c. Book ISBN After selecting user, the following menu should be displayed: • Inquire about the specific books including the author information. • Request for a new book • Complain if any Now, after I see the above menu, I will make a selection. Based on my selection, your program should call some function to carry out the operation needed for that selected task. After that operation is performed, you should show me the above mentioned selection menu again. This should continue in an infinite loop until I want to exit the program.

Key Questions You will be able to answer the following question about this topic. How can I write an effective business report that contains the standard sections that are typically included in a report? Assignment With the above questions in mind, read the assignment description below and complete the assignment: Make sure that you include all the components called for in the assignment.  When you have completed the assignment, submit your report by copying/pasting it into the text box in the assignment submission. ------------------------------------------------------------------------------------------------------   Report topic Gather information about a career or position to which you aspire. Learn about the nature of the job. Discover whether certification, a license or experience is required. One of the best places to search is the latest Occupational Outlook Handbook compiled by the U.S. Bureau of Labor Statistics. Google the latest Handbook and either input your desired occupation using the Search box or click an A-Z Index Link. Also, determine what training, education and/or other background you might need to be promoted into such a position. Evaluate your strengths and weaknesses in relation to this goal. Your Task: To write a report to your instructor that describes your targeted career area/promotion, including the following:  Discuss the nature of the work, working conditions, necessary qualifications, and the future job outlook for the occupation, including any special considerations if you are in the US on a visa.  Provide information about the career/position gained through interviews with one or more individuals working in similar positions.  Create a SWOT analysis for your potential to be considered for this career/position.  Include any additional personal insights regarding information that would affect your employability/promotability. The length should be in the range of about 1000 words +/- 10%. Longer is not necessarily better, but it should not be fewer than 900 words nor longer than 1100 words. Make sure that your report contains all of the following headings, shown below in Components of a business report. Components of a business report A business report contains a collection of objective data that the reader should consider. The report can contain suggestions and recommendations, but its primary purpose should be to present facts and information. Please note this important distinction. A report is not a proposal. A proposal is a sales pitch with the single objective of promoting an idea. A business proposal spends most of its time promoting suggestions and recommendations. A business report spends most of its time presenting objective facts. Proposals propose. Reports report. Please include all of the following headings and sections in your report: Title Page Business reports generally follow a formal structure, unless they are very short email reports. Most moderate to long reports begin with a title page. The title page shows the full title of the report, the name of the author and the names of audience members or groups. Executive Summary This brief summary presents the purpose, methods, scope, findings, conclusions and recommendations of the reportl. A high-level business executive might choose not to read the entire report, but instead to read only the executive summary. Write the summary with enough detail to provide a busy executive with the most important elements of the report. Table of Contents The table of contents page usually comes immediately after the title page and before the executive summary. It should show each section of the report by name and page number. List of Figures, Tables, Abbreviations or Symbols (optional) A good rule of thumb is that if your report includes more than five figures, illustrations or tables, you should list them by page number, immediately after the table of contents page. If the reportl contains abbreviations or symbols that might not be familiar to all readers, include those abbreviations and symbols, plus their definitions and explanations in this section. Not all reports need to contain this section.   Introduction Start the body of the report with an introductory paragraph, with the heading “Introduction.” The introduction should present the purpose and scope of the report, and present background information that might be necessary for readers to know so that they can understand the rest of the report. Body The next heading should read “Body,” and this begins the heart of the report. You can include subheadings to introduce the various information categories that make up the body. Consider including tables of data or financial information, charts, graphs and illustrations. Conclusions and Recommendations The body of the report ends with “Conclusions and Recommendations.” In this section, you summarize the objective data and findings, and propose recommendations, if necessary and appropriate. Bibliography If your reportl presents data that you gathered from published sources, show those sources in a bibliography that should include traditional publications, Internet sources and people who you might have interviewed.

help 1. Value Iteration for Markov Decision Process ద Bookmark this page Homework due Aug 17, 2022 14:59 +03 Consider the following problem through the lens of a Markov Decision Process (MDP), and answer questions 1 - 3 accordingly. Damilola is a soccer player for the ML United under-15s who is debating whether to sign for the NLP Albion youth team or the Computer Vision Wanderers youth team. After three years, signing for NLP Albion has two possibilities: He will still be in the youth team, earning 10,000 (60\% chance), or he will make the senior team and earn 70,000 (40\% chance). Lastly, he is assured of making the Computer Vision Wanderers senior team after three years, with a salary of 37,000. Q2 1 point possible (graded) Let us now assume that Damilola cares about the utility derived from the salary as opposed to the salary $S$ itself. And his utility function, which baffles economists, is given by Utility, $U=\Psi S^{2}+\zeta$ where $\Psi, \zeta>0$, and $\Psi$ \& are constants. In this scenario, the optimal policy $\pi^{*}$ (ML United under-15s) would be to sign for NLP Albion. True False Submit You have used 0 of 1 attempt Save Q3 1 point possible (graded) There are 3 unique states defined in total in this setting. True False b 3 points possible (graded) If we initialize the value function with 0 , enter the value of state $B$ after: one value iteration, $V_{B 1}^{*}$ two value iterations, $V_{B 2}^{*}$ infinite value iterations, $V_{B}^{*}$ Submit You have used 0 of 3 attempts Save C 1 point possible (graded) Select all that are true In an MDP, the optimal policy for a given state $s$ is unique The problem of determining the value of a state is solved recursively by value iteration algorithm For a given MDP, the value function $V^{*}(s)$ of each state is known a priori $V^{*}(s)=\sum_{s^{\prime}} T\left(s, a, s^{\prime}\right)\left[R\left(s, a, s^{\prime}\right)+\gamma V^{*}\left(s^{\prime}\right)\right]$ $Q^{*}(s, a)=\sum_{s^{\prime}} T\left(s, a, s^{\prime}\right)\left[R\left(s, a, s^{\prime}\right)+\gamma V^{*}\left(s^{\prime}\right)\right]$