Let G = ( { S,A,B,C,D}, {a,b,c}, P, S ), where P consists of the following productions. G: S  aSb | bSa | bAb A  aAa | cB B  CBD | D |  C  a | b D  c |  Convert G into its equivalent PDA which accepts L(G) by empty stack

Given a heap with more than ten nodes, which of the following statements is wrong? O a. None of the other answers O b. The heap could be a binary search tree. O. The heap could be a full binary tree. O d. The heap could be a complete binary tree. Which of the following related to a completed graph is correct? O a. All of the other answers O b. There exists a path between each pair of nodes in a spanning tree of the graph. O. There exists a cycle between each pair of nodes in a spanning tree of the graph. O d. There exists an edge between each pair of nodes in a spanning tree of the graph.

Write it in Racket Define a function (bst? n) to test for membership to determine if a collection of nodes satisfies the bst property (is a bst). The BST property is that for any node n in the bst: all nodes to left must have value < (node-value n) all nodes to right must have value > (node-value n) Skeleton for function (define (bst? n) (cond )) The function can be defined as one big conditional with multiple cases. Some of the cases are base cases, others will require a recursive call to bst? There is more than one way to develop the cases, but here are some starting point ideas. If n is null or empty, result is true #t else if n is not a node structure, then result is false #f else if n has no child nodes, then result is true #t else if n has one child on the left, then result is n.left.value < n.value AND bst?(n.left) is true else if n has one child on the right, then result is n.right.value > n.value AND bst?(n.right) is true else if n has two children, then result is…

E

On S = f2; 4; 6; 10; 12; 20; 30; 60g we work with the divisibility relation R:xRy , x divides y:(i) Draw the Hasse diagram of R.(ii) Find all R-minimal elements.(iii) Find all R-maximal elements.(iv) Find all non-empty subsets U  S, so that 6 is an R-lowerbound of U.(v) Let A = f6; 10; 12g. If A admits an R-supremum,  nd it. If A admits an R-in mum,  nd it.(vi) Is R a lattice?