Dunne and shneiderman list this as a graph readability principle 1. every node should be visible 2. for every node, you should be able to count its degree 3. clusters and outliers should be identifiable 4. all of the above

Consider the series where in this problem you must attempt to use the ratio test to decide whether the series converges. compute enter the numerical value of the limit l if it converges, inf if it diverges to infinity, minf if it diverges to negative infinity, or div if it diverges but not to infinity or negative infinity.