The Java class beneath characterizes a line information structure with a proper limit. public class FixedCapacityQueue { int[] mData = invalid; int mHead=0;//record of first full cell int mTail=0;//file of next void cell public FixedCapacityQueue(int limit) { mData = new int[capacity]; } public boolean enqueue(int x) { if (mTail==mData.length) get back bogus; mData[mTail]=x; mTail++; bring valid back; } public int dequeue() { on the off chance that (mTail==mHead) return - 1; int v=mData[mHead]; mHead++; bring v back; } } (a) Explain the dangers presented by the absence of access modifiers indicated on the state. Which access modifier is fitting for these substances? [3 marks] (b) Discuss the decision to flag enqueue and dequeue blunders utilizing return upsides of misleading and - 1, individually. Propose a superior other option and alter enqueue and dequeue to utilize it. [5 marks] (c) Explain how an enqueue procedure on a FixedCapacityQueue item could fizzle with a mistake in any event, when there are less things in the line than the appointed limit of the article. Tell the best way to fix this. [3 marks] (d) Rewrite the class to utilize Java's Generics with the goal that it tends to be utilized to address lines of inconsistent items (Integers, Strings, and so forth) Utilize the java.util.ArrayList class rather than int[] for the kind of mData

P17. In Figure 5.13, consider the path information that reaches stub networks W, X, and Y. Based on the information available at W and X, what are their respective views of the network topology? Justify your answer. The topology view at Y is shown below. WA C X SOCKET PROGRAMMING ASSE Stub network Y's view of the topology Y