Use proof by induction, show that, in BFS-tree T of a connected graph G rooted at r,l(v) = dT (r, v).

2b written out on paper please

Represent the polyhedron defined by x1+x2>=1 with a minimal set of generators. Thanks !

Find an x such that (m) + Σkez (m) (45_2m) = k 5-k 0 for any m.

Write down the the cardinal functions for these 5 nodes , and usethe Lagrange polynomials to interpolate these 5 nodes, show the polynomial.

Give an example of a bounded function that is defined on R, continuous at each point except the points 1 and-1, and has neither a removable discontinuity nor a jump discontinuity at 1 and-1.

Suppose (X,≺) is a well-ordering. Then (X,≺) is not isomorphic to (pred(X,≺,x),≺) for any x ∈ X.